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_label00_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 05:59:17,698 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 05:59:17,700 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 05:59:17,715 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 05:59:17,715 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 05:59:17,716 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 05:59:17,717 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 05:59:17,719 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 05:59:17,721 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 05:59:17,722 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 05:59:17,724 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 05:59:17,726 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 05:59:17,727 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 05:59:17,730 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 05:59:17,731 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 05:59:17,732 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 05:59:17,736 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 05:59:17,738 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 05:59:17,741 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 05:59:17,745 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 05:59:17,746 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 05:59:17,753 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 05:59:17,755 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 05:59:17,756 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 05:59:17,756 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 05:59:17,760 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 05:59:17,761 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 05:59:17,762 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 05:59:17,765 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 05:59:17,767 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 05:59:17,767 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 05:59:17,769 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 05:59:17,770 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 05:59:17,770 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 05:59:17,771 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 05:59:17,772 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 05:59:17,772 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 05:59:17,799 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 05:59:17,799 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 05:59:17,800 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 05:59:17,800 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 05:59:17,800 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 05:59:17,801 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 05:59:17,801 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-19 05:59:17,801 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 05:59:17,801 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 05:59:17,801 INFO L133 SettingsManager]: * Abstract domain=IntervalDomain [2018-09-19 05:59:17,802 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 05:59:17,802 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 05:59:17,802 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 05:59:17,803 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 05:59:17,803 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 05:59:17,804 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 05:59:17,804 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 05:59:17,804 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 05:59:17,804 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 05:59:17,804 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 05:59:17,805 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 05:59:17,805 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 05:59:17,805 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 05:59:17,805 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 05:59:17,807 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 05:59:17,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 05:59:17,807 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 05:59:17,808 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 05:59:17,808 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 05:59:17,808 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 05:59:17,808 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 05:59:17,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 05:59:17,809 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 05:59:17,809 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 05:59:17,809 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 05:59:17,871 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 05:59:17,888 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 05:59:17,896 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 05:59:17,897 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 05:59:17,898 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 05:59:17,899 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label00_true-unreach-call.c [2018-09-19 05:59:18,298 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96f43a624/67fc756877344b128ca85aee0e295967/FLAG3d2394bb9 [2018-09-19 05:59:18,535 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 05:59:18,536 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label00_true-unreach-call.c [2018-09-19 05:59:18,553 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96f43a624/67fc756877344b128ca85aee0e295967/FLAG3d2394bb9 [2018-09-19 05:59:18,580 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96f43a624/67fc756877344b128ca85aee0e295967 [2018-09-19 05:59:18,595 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 05:59:18,599 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 05:59:18,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 05:59:18,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 05:59:18,609 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 05:59:18,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 05:59:18" (1/1) ... [2018-09-19 05:59:18,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@746fe49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:59:18, skipping insertion in model container [2018-09-19 05:59:18,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 05:59:18" (1/1) ... [2018-09-19 05:59:18,628 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 05:59:19,220 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 05:59:19,238 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 05:59:19,367 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 05:59:19,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:59:19 WrapperNode [2018-09-19 05:59:19,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 05:59:19,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 05:59:19,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 05:59:19,421 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 05:59:19,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:59:19" (1/1) ... [2018-09-19 05:59:19,461 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:59:19" (1/1) ... [2018-09-19 05:59:19,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 05:59:19,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 05:59:19,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 05:59:19,553 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 05:59:19,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:59:19" (1/1) ... [2018-09-19 05:59:19,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:59:19" (1/1) ... [2018-09-19 05:59:19,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:59:19" (1/1) ... [2018-09-19 05:59:19,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:59:19" (1/1) ... [2018-09-19 05:59:19,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:59:19" (1/1) ... [2018-09-19 05:59:19,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:59:19" (1/1) ... [2018-09-19 05:59:19,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:59:19" (1/1) ... [2018-09-19 05:59:19,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 05:59:19,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 05:59:19,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 05:59:19,797 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 05:59:19,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:59:19" (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 05:59:19,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 05:59:19,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 05:59:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 05:59:19,873 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 05:59:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 05:59:19,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 05:59:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 05:59:19,874 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 05:59:22,895 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 05:59:22,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 05:59:22 BoogieIcfgContainer [2018-09-19 05:59:22,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 05:59:22,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 05:59:22,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 05:59:22,901 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 05:59:22,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 05:59:18" (1/3) ... [2018-09-19 05:59:22,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a6bc69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 05:59:22, skipping insertion in model container [2018-09-19 05:59:22,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 05:59:19" (2/3) ... [2018-09-19 05:59:22,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a6bc69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 05:59:22, skipping insertion in model container [2018-09-19 05:59:22,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 05:59:22" (3/3) ... [2018-09-19 05:59:22,905 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label00_true-unreach-call.c [2018-09-19 05:59:22,915 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 05:59:22,926 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 05:59:22,981 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 05:59:22,982 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 05:59:22,983 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 05:59:22,983 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 05:59:22,983 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 05:59:22,983 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 05:59:22,983 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 05:59:22,984 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 05:59:22,984 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 05:59:23,010 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 05:59:23,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-19 05:59:23,021 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 05:59:23,022 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] [2018-09-19 05:59:23,024 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 05:59:23,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1416877404, now seen corresponding path program 1 times [2018-09-19 05:59:23,032 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 05:59:23,033 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2018-09-19 05:59:23,036 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], [333], [335], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 05:59:23,082 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 05:59:23,082 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 05:59:23,366 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 05:59:23,368 INFO L272 AbstractInterpreter]: Visited 53 different actions 53 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 05:59:23,402 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 05:59:23,577 INFO L232 lantSequenceWeakener]: Weakened 51 states. On average, predicates are now at 75.29% of their original sizes. [2018-09-19 05:59:23,578 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 05:59:23,836 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 05:59:23,838 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 05:59:23,838 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 05:59:23,839 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 05:59:23,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 05:59:23,857 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 05:59:23,858 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 05:59:23,861 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 05:59:26,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 05:59:26,658 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 05:59:26,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 05:59:26,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-09-19 05:59:26,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 05:59:26,678 INFO L225 Difference]: With dead ends: 576 [2018-09-19 05:59:26,679 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 05:59:26,685 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 53 GetRequests, 49 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 05:59:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 05:59:26,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 05:59:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 05:59:26,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 05:59:26,755 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 54 [2018-09-19 05:59:26,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 05:59:26,756 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 05:59:26,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 05:59:26,757 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 05:59:26,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-09-19 05:59:26,764 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 05:59:26,764 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:59:26,765 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 05:59:26,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1322178669, now seen corresponding path program 1 times [2018-09-19 05:59:26,765 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 05:59:26,766 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2018-09-19 05:59:26,766 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], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 05:59:26,772 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 05:59:26,772 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 05:59:26,854 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 05:59:26,968 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 05:59:26,968 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 05:59:27,001 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 05:59:27,166 INFO L232 lantSequenceWeakener]: Weakened 122 states. On average, predicates are now at 73.87% of their original sizes. [2018-09-19 05:59:27,167 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 05:59:27,955 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 05:59:27,955 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 05:59:27,955 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 05:59:27,956 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 05:59:27,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 05:59:27,957 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 05:59:27,958 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 05:59:27,958 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 05:59:33,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 05:59:33,031 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 05:59:33,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 05:59:33,032 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 125 [2018-09-19 05:59:33,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 05:59:33,040 INFO L225 Difference]: With dead ends: 717 [2018-09-19 05:59:33,040 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 05:59:33,043 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 131 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 05:59:33,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 05:59:33,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 05:59:33,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 05:59:33,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 669 transitions. [2018-09-19 05:59:33,073 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 669 transitions. Word has length 125 [2018-09-19 05:59:33,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 05:59:33,074 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 669 transitions. [2018-09-19 05:59:33,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 05:59:33,074 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 669 transitions. [2018-09-19 05:59:33,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-19 05:59:33,081 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 05:59:33,081 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:59:33,082 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 05:59:33,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1136942040, now seen corresponding path program 1 times [2018-09-19 05:59:33,082 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 05:59:33,082 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2018-09-19 05:59:33,083 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], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 05:59:33,088 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 05:59:33,091 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 05:59:33,148 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 05:59:33,272 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 05:59:33,272 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 05:59:33,311 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 05:59:33,486 INFO L232 lantSequenceWeakener]: Weakened 131 states. On average, predicates are now at 73.79% of their original sizes. [2018-09-19 05:59:33,488 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 05:59:33,734 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 05:59:33,734 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 05:59:33,734 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 05:59:33,735 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 05:59:33,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 05:59:33,735 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 05:59:33,736 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 05:59:33,736 INFO L87 Difference]: Start difference. First operand 505 states and 669 transitions. Second operand 10 states. [2018-09-19 05:59:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 05:59:37,360 INFO L93 Difference]: Finished difference Result 1149 states and 1736 transitions. [2018-09-19 05:59:37,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 05:59:37,364 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 134 [2018-09-19 05:59:37,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 05:59:37,378 INFO L225 Difference]: With dead ends: 1149 [2018-09-19 05:59:37,379 INFO L226 Difference]: Without dead ends: 794 [2018-09-19 05:59:37,381 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 141 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 05:59:37,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-09-19 05:59:37,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 783. [2018-09-19 05:59:37,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-09-19 05:59:37,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1001 transitions. [2018-09-19 05:59:37,433 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1001 transitions. Word has length 134 [2018-09-19 05:59:37,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 05:59:37,434 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 1001 transitions. [2018-09-19 05:59:37,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 05:59:37,434 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1001 transitions. [2018-09-19 05:59:37,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-19 05:59:37,439 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 05:59:37,439 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:59:37,440 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 05:59:37,440 INFO L82 PathProgramCache]: Analyzing trace with hash 291298896, now seen corresponding path program 1 times [2018-09-19 05:59:37,440 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 05:59:37,440 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2018-09-19 05:59:37,441 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 05:59:37,446 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 05:59:37,446 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 05:59:37,542 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 05:59:37,780 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 05:59:37,780 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 05:59:37,819 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 05:59:38,058 INFO L232 lantSequenceWeakener]: Weakened 167 states. On average, predicates are now at 73.56% of their original sizes. [2018-09-19 05:59:38,059 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 05:59:38,782 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 05:59:38,782 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 05:59:38,782 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 05:59:38,783 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 05:59:38,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 05:59:38,784 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 05:59:38,784 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 05:59:38,785 INFO L87 Difference]: Start difference. First operand 783 states and 1001 transitions. Second operand 10 states. [2018-09-19 05:59:42,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 05:59:42,152 INFO L93 Difference]: Finished difference Result 1723 states and 2332 transitions. [2018-09-19 05:59:42,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 05:59:42,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 170 [2018-09-19 05:59:42,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 05:59:42,159 INFO L225 Difference]: With dead ends: 1723 [2018-09-19 05:59:42,160 INFO L226 Difference]: Without dead ends: 1090 [2018-09-19 05:59:42,162 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 176 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 05:59:42,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-09-19 05:59:42,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1081. [2018-09-19 05:59:42,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2018-09-19 05:59:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1351 transitions. [2018-09-19 05:59:42,195 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1351 transitions. Word has length 170 [2018-09-19 05:59:42,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 05:59:42,196 INFO L480 AbstractCegarLoop]: Abstraction has 1081 states and 1351 transitions. [2018-09-19 05:59:42,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 05:59:42,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1351 transitions. [2018-09-19 05:59:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-09-19 05:59:42,200 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 05:59:42,200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:59:42,200 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 05:59:42,201 INFO L82 PathProgramCache]: Analyzing trace with hash 991767315, now seen corresponding path program 1 times [2018-09-19 05:59:42,201 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 05:59:42,201 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-09-19 05:59:42,202 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 05:59:42,206 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 05:59:42,207 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 05:59:42,398 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 05:59:42,398 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 05:59:42,437 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 05:59:42,576 INFO L232 lantSequenceWeakener]: Weakened 186 states. On average, predicates are now at 73.48% of their original sizes. [2018-09-19 05:59:42,576 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 05:59:42,705 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 05:59:42,705 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 05:59:42,705 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 05:59:42,705 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 05:59:42,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 05:59:42,706 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 05:59:42,706 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 05:59:42,707 INFO L87 Difference]: Start difference. First operand 1081 states and 1351 transitions. Second operand 10 states. [2018-09-19 05:59:44,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 05:59:44,697 INFO L93 Difference]: Finished difference Result 2464 states and 3201 transitions. [2018-09-19 05:59:44,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 05:59:44,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 189 [2018-09-19 05:59:44,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 05:59:44,706 INFO L225 Difference]: With dead ends: 2464 [2018-09-19 05:59:44,707 INFO L226 Difference]: Without dead ends: 1533 [2018-09-19 05:59:44,710 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 195 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 05:59:44,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2018-09-19 05:59:44,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1521. [2018-09-19 05:59:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2018-09-19 05:59:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1842 transitions. [2018-09-19 05:59:44,761 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1842 transitions. Word has length 189 [2018-09-19 05:59:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 05:59:44,762 INFO L480 AbstractCegarLoop]: Abstraction has 1521 states and 1842 transitions. [2018-09-19 05:59:44,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 05:59:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1842 transitions. [2018-09-19 05:59:44,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-09-19 05:59:44,766 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 05:59:44,767 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 05:59:44,767 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 05:59:44,767 INFO L82 PathProgramCache]: Analyzing trace with hash -400280177, now seen corresponding path program 1 times [2018-09-19 05:59:44,767 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 05:59:44,768 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2018-09-19 05:59:44,768 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], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 05:59:44,774 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 05:59:44,774 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 05:59:44,805 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 05:59:44,877 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 05:59:44,878 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 05:59:44,892 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 05:59:45,007 INFO L232 lantSequenceWeakener]: Weakened 198 states. On average, predicates are now at 73.48% of their original sizes. [2018-09-19 05:59:45,007 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 05:59:45,094 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 05:59:45,094 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 05:59:45,094 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 05:59:45,094 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 05:59:45,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 05:59:45,095 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 05:59:45,095 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 05:59:45,096 INFO L87 Difference]: Start difference. First operand 1521 states and 1842 transitions. Second operand 10 states. [2018-09-19 05:59:47,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 05:59:47,462 INFO L93 Difference]: Finished difference Result 3061 states and 3845 transitions. [2018-09-19 05:59:47,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 05:59:47,468 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 201 [2018-09-19 05:59:47,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 05:59:47,480 INFO L225 Difference]: With dead ends: 3061 [2018-09-19 05:59:47,481 INFO L226 Difference]: Without dead ends: 1690 [2018-09-19 05:59:47,485 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 208 GetRequests, 192 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 05:59:47,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2018-09-19 05:59:47,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1672. [2018-09-19 05:59:47,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-09-19 05:59:47,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2020 transitions. [2018-09-19 05:59:47,530 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2020 transitions. Word has length 201 [2018-09-19 05:59:47,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 05:59:47,530 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 2020 transitions. [2018-09-19 05:59:47,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 05:59:47,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2020 transitions. [2018-09-19 05:59:47,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-09-19 05:59:47,535 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 05:59:47,535 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 05:59:47,535 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 05:59:47,536 INFO L82 PathProgramCache]: Analyzing trace with hash -223324117, now seen corresponding path program 1 times [2018-09-19 05:59:47,536 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 05:59:47,536 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 204 with the following transitions: [2018-09-19 05:59:47,536 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], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [526], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 05:59:47,539 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 05:59:47,539 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 05:59:47,566 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 05:59:47,656 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 05:59:47,656 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 05:59:47,694 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 05:59:47,821 INFO L232 lantSequenceWeakener]: Weakened 200 states. On average, predicates are now at 73.47% of their original sizes. [2018-09-19 05:59:47,821 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 05:59:48,422 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 05:59:48,425 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 05:59:48,425 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 05:59:48,425 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 05:59:48,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 05:59:48,426 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 05:59:48,426 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 05:59:48,426 INFO L87 Difference]: Start difference. First operand 1672 states and 2020 transitions. Second operand 10 states. [2018-09-19 05:59:51,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 05:59:51,083 INFO L93 Difference]: Finished difference Result 3362 states and 4211 transitions. [2018-09-19 05:59:51,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 05:59:51,083 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 203 [2018-09-19 05:59:51,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 05:59:51,093 INFO L225 Difference]: With dead ends: 3362 [2018-09-19 05:59:51,093 INFO L226 Difference]: Without dead ends: 1840 [2018-09-19 05:59:51,098 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 210 GetRequests, 194 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 05:59:51,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2018-09-19 05:59:51,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1823. [2018-09-19 05:59:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1823 states. [2018-09-19 05:59:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 2218 transitions. [2018-09-19 05:59:51,145 INFO L78 Accepts]: Start accepts. Automaton has 1823 states and 2218 transitions. Word has length 203 [2018-09-19 05:59:51,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 05:59:51,145 INFO L480 AbstractCegarLoop]: Abstraction has 1823 states and 2218 transitions. [2018-09-19 05:59:51,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 05:59:51,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 2218 transitions. [2018-09-19 05:59:51,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-09-19 05:59:51,150 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 05:59:51,150 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 05:59:51,150 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 05:59:51,151 INFO L82 PathProgramCache]: Analyzing trace with hash 598938979, now seen corresponding path program 1 times [2018-09-19 05:59:51,151 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 05:59:51,151 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 208 with the following transitions: [2018-09-19 05:59:51,151 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], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [542], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 05:59:51,153 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 05:59:51,153 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 05:59:51,179 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 05:59:51,264 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 05:59:51,265 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 05:59:51,305 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 05:59:51,428 INFO L232 lantSequenceWeakener]: Weakened 204 states. On average, predicates are now at 73.46% of their original sizes. [2018-09-19 05:59:51,429 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 05:59:51,523 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 05:59:51,523 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 05:59:51,523 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 05:59:51,524 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 05:59:51,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 05:59:51,524 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 05:59:51,524 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 05:59:51,525 INFO L87 Difference]: Start difference. First operand 1823 states and 2218 transitions. Second operand 10 states. [2018-09-19 05:59:53,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 05:59:53,600 INFO L93 Difference]: Finished difference Result 3819 states and 4796 transitions. [2018-09-19 05:59:53,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 05:59:53,607 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 207 [2018-09-19 05:59:53,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 05:59:53,618 INFO L225 Difference]: With dead ends: 3819 [2018-09-19 05:59:53,618 INFO L226 Difference]: Without dead ends: 2146 [2018-09-19 05:59:53,622 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 214 GetRequests, 198 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 05:59:53,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2018-09-19 05:59:53,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2123. [2018-09-19 05:59:53,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2123 states. [2018-09-19 05:59:53,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 2596 transitions. [2018-09-19 05:59:53,686 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 2596 transitions. Word has length 207 [2018-09-19 05:59:53,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 05:59:53,687 INFO L480 AbstractCegarLoop]: Abstraction has 2123 states and 2596 transitions. [2018-09-19 05:59:53,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 05:59:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 2596 transitions. [2018-09-19 05:59:53,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-09-19 05:59:53,693 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 05:59:53,693 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 05:59:53,693 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 05:59:53,693 INFO L82 PathProgramCache]: Analyzing trace with hash -198150917, now seen corresponding path program 1 times [2018-09-19 05:59:53,694 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 05:59:53,694 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 208 with the following transitions: [2018-09-19 05:59:53,694 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], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 05:59:53,696 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 05:59:53,697 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 05:59:53,729 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 05:59:53,817 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 05:59:53,818 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 05:59:53,854 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 05:59:53,981 INFO L232 lantSequenceWeakener]: Weakened 204 states. On average, predicates are now at 73.46% of their original sizes. [2018-09-19 05:59:53,981 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 05:59:54,074 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 05:59:54,074 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 05:59:54,074 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 05:59:54,075 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 05:59:54,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 05:59:54,075 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 05:59:54,075 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 05:59:54,076 INFO L87 Difference]: Start difference. First operand 2123 states and 2596 transitions. Second operand 10 states. [2018-09-19 05:59:56,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 05:59:56,486 INFO L93 Difference]: Finished difference Result 4418 states and 5553 transitions. [2018-09-19 05:59:56,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 05:59:56,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 207 [2018-09-19 05:59:56,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 05:59:56,498 INFO L225 Difference]: With dead ends: 4418 [2018-09-19 05:59:56,498 INFO L226 Difference]: Without dead ends: 2445 [2018-09-19 05:59:56,503 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 214 GetRequests, 198 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 05:59:56,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2018-09-19 05:59:56,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 2411. [2018-09-19 05:59:56,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2018-09-19 05:59:56,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2974 transitions. [2018-09-19 05:59:56,562 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2974 transitions. Word has length 207 [2018-09-19 05:59:56,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 05:59:56,563 INFO L480 AbstractCegarLoop]: Abstraction has 2411 states and 2974 transitions. [2018-09-19 05:59:56,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 05:59:56,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2974 transitions. [2018-09-19 05:59:56,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-09-19 05:59:56,568 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 05:59:56,568 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 05:59:56,568 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 05:59:56,568 INFO L82 PathProgramCache]: Analyzing trace with hash -666149577, now seen corresponding path program 1 times [2018-09-19 05:59:56,569 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 05:59:56,569 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 214 with the following transitions: [2018-09-19 05:59:56,569 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], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 05:59:56,571 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 05:59:56,572 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 05:59:56,599 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 05:59:59,292 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 05:59:59,292 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 05:59:59,300 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 05:59:59,850 INFO L232 lantSequenceWeakener]: Weakened 210 states. On average, predicates are now at 73.44% of their original sizes. [2018-09-19 05:59:59,850 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 05:59:59,938 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 05:59:59,940 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 05:59:59,940 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 05:59:59,940 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 05:59:59,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 05:59:59,941 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 05:59:59,941 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 05:59:59,941 INFO L87 Difference]: Start difference. First operand 2411 states and 2974 transitions. Second operand 10 states. [2018-09-19 06:00:02,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:00:02,083 INFO L93 Difference]: Finished difference Result 4850 states and 6141 transitions. [2018-09-19 06:00:02,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:00:02,083 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 213 [2018-09-19 06:00:02,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:00:02,093 INFO L225 Difference]: With dead ends: 4850 [2018-09-19 06:00:02,093 INFO L226 Difference]: Without dead ends: 2589 [2018-09-19 06:00:02,099 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 220 GetRequests, 204 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:00:02,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2018-09-19 06:00:02,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2566. [2018-09-19 06:00:02,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2566 states. [2018-09-19 06:00:02,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3192 transitions. [2018-09-19 06:00:02,159 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3192 transitions. Word has length 213 [2018-09-19 06:00:02,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:00:02,160 INFO L480 AbstractCegarLoop]: Abstraction has 2566 states and 3192 transitions. [2018-09-19 06:00:02,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:00:02,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3192 transitions. [2018-09-19 06:00:02,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-09-19 06:00:02,166 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:00:02,166 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:00:02,166 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:00:02,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1908563472, now seen corresponding path program 1 times [2018-09-19 06:00:02,167 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:00:02,167 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 223 with the following transitions: [2018-09-19 06:00:02,168 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], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [602], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:00:02,170 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:00:02,170 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:00:02,196 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:00:02,755 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:00:02,755 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:00:02,784 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:00:03,051 INFO L232 lantSequenceWeakener]: Weakened 219 states. On average, predicates are now at 73.41% of their original sizes. [2018-09-19 06:00:03,052 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:00:03,206 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:00:03,207 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:00:03,207 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:00:03,207 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:00:03,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:00:03,208 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:00:03,208 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:00:03,208 INFO L87 Difference]: Start difference. First operand 2566 states and 3192 transitions. Second operand 10 states. [2018-09-19 06:00:04,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:00:04,899 INFO L93 Difference]: Finished difference Result 5163 states and 6584 transitions. [2018-09-19 06:00:04,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:00:04,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 222 [2018-09-19 06:00:04,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:00:04,920 INFO L225 Difference]: With dead ends: 5163 [2018-09-19 06:00:04,920 INFO L226 Difference]: Without dead ends: 2747 [2018-09-19 06:00:04,925 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 229 GetRequests, 213 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:00:04,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2018-09-19 06:00:04,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 2721. [2018-09-19 06:00:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2721 states. [2018-09-19 06:00:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2721 states to 2721 states and 3412 transitions. [2018-09-19 06:00:04,982 INFO L78 Accepts]: Start accepts. Automaton has 2721 states and 3412 transitions. Word has length 222 [2018-09-19 06:00:04,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:00:04,983 INFO L480 AbstractCegarLoop]: Abstraction has 2721 states and 3412 transitions. [2018-09-19 06:00:04,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:00:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2721 states and 3412 transitions. [2018-09-19 06:00:04,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-19 06:00:04,989 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:00:04,989 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:00:04,989 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:00:04,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2092205444, now seen corresponding path program 1 times [2018-09-19 06:00:04,990 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:00:04,990 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 229 with the following transitions: [2018-09-19 06:00:04,990 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], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [626], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:00:04,992 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:00:04,992 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:00:05,017 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:00:05,144 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:00:05,144 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:00:05,180 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:00:05,336 INFO L232 lantSequenceWeakener]: Weakened 225 states. On average, predicates are now at 73.39% of their original sizes. [2018-09-19 06:00:05,336 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:00:05,509 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:00:05,509 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:00:05,509 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:00:05,510 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:00:05,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:00:05,510 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:00:05,510 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:00:05,511 INFO L87 Difference]: Start difference. First operand 2721 states and 3412 transitions. Second operand 10 states. [2018-09-19 06:00:07,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:00:07,415 INFO L93 Difference]: Finished difference Result 5472 states and 7022 transitions. [2018-09-19 06:00:07,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:00:07,415 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 228 [2018-09-19 06:00:07,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:00:07,426 INFO L225 Difference]: With dead ends: 5472 [2018-09-19 06:00:07,426 INFO L226 Difference]: Without dead ends: 2901 [2018-09-19 06:00:07,431 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 235 GetRequests, 219 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:00:07,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2018-09-19 06:00:07,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2876. [2018-09-19 06:00:07,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2876 states. [2018-09-19 06:00:07,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 3624 transitions. [2018-09-19 06:00:07,495 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 3624 transitions. Word has length 228 [2018-09-19 06:00:07,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:00:07,496 INFO L480 AbstractCegarLoop]: Abstraction has 2876 states and 3624 transitions. [2018-09-19 06:00:07,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:00:07,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 3624 transitions. [2018-09-19 06:00:07,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-09-19 06:00:07,502 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:00:07,502 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:00:07,503 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:00:07,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1322762731, now seen corresponding path program 1 times [2018-09-19 06:00:07,503 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:00:07,503 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 236 with the following transitions: [2018-09-19 06:00:07,504 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], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:00:07,506 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:00:07,506 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:00:07,530 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:00:07,671 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:00:07,671 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:00:07,716 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:00:07,855 INFO L232 lantSequenceWeakener]: Weakened 232 states. On average, predicates are now at 73.37% of their original sizes. [2018-09-19 06:00:07,856 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:00:07,965 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:00:07,965 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:00:07,965 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:00:07,965 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:00:07,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:00:07,966 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:00:07,966 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:00:07,967 INFO L87 Difference]: Start difference. First operand 2876 states and 3624 transitions. Second operand 10 states. [2018-09-19 06:00:10,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:00:10,610 INFO L93 Difference]: Finished difference Result 5959 states and 7691 transitions. [2018-09-19 06:00:10,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:00:10,610 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 235 [2018-09-19 06:00:10,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:00:10,622 INFO L225 Difference]: With dead ends: 5959 [2018-09-19 06:00:10,622 INFO L226 Difference]: Without dead ends: 3233 [2018-09-19 06:00:10,628 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 242 GetRequests, 226 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:00:10,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3233 states. [2018-09-19 06:00:10,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3233 to 3184. [2018-09-19 06:00:10,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3184 states. [2018-09-19 06:00:10,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 4030 transitions. [2018-09-19 06:00:10,697 INFO L78 Accepts]: Start accepts. Automaton has 3184 states and 4030 transitions. Word has length 235 [2018-09-19 06:00:10,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:00:10,698 INFO L480 AbstractCegarLoop]: Abstraction has 3184 states and 4030 transitions. [2018-09-19 06:00:10,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:00:10,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 4030 transitions. [2018-09-19 06:00:10,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-09-19 06:00:10,705 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:00:10,705 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:00:10,705 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:00:10,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1963915651, now seen corresponding path program 1 times [2018-09-19 06:00:10,706 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:00:10,706 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 244 with the following transitions: [2018-09-19 06:00:10,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], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:00:10,709 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:00:10,709 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:00:10,762 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:00:10,936 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:00:10,936 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:00:10,942 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:00:11,091 INFO L232 lantSequenceWeakener]: Weakened 240 states. On average, predicates are now at 73.35% of their original sizes. [2018-09-19 06:00:11,091 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:00:11,188 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:00:11,189 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:00:11,189 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:00:11,189 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:00:11,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:00:11,190 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:00:11,190 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:00:11,190 INFO L87 Difference]: Start difference. First operand 3184 states and 4030 transitions. Second operand 10 states. [2018-09-19 06:00:14,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:00:14,022 INFO L93 Difference]: Finished difference Result 6547 states and 8487 transitions. [2018-09-19 06:00:14,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:00:14,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 243 [2018-09-19 06:00:14,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:00:14,039 INFO L225 Difference]: With dead ends: 6547 [2018-09-19 06:00:14,039 INFO L226 Difference]: Without dead ends: 3513 [2018-09-19 06:00:14,046 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 250 GetRequests, 234 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:00:14,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3513 states. [2018-09-19 06:00:14,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3513 to 3486. [2018-09-19 06:00:14,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3486 states. [2018-09-19 06:00:14,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 4452 transitions. [2018-09-19 06:00:14,115 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 4452 transitions. Word has length 243 [2018-09-19 06:00:14,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:00:14,116 INFO L480 AbstractCegarLoop]: Abstraction has 3486 states and 4452 transitions. [2018-09-19 06:00:14,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:00:14,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 4452 transitions. [2018-09-19 06:00:14,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-09-19 06:00:14,122 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:00:14,123 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, 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:00:14,123 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:00:14,123 INFO L82 PathProgramCache]: Analyzing trace with hash 515955091, now seen corresponding path program 1 times [2018-09-19 06:00:14,123 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:00:14,124 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 248 with the following transitions: [2018-09-19 06:00:14,124 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], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [702], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:00:14,126 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:00:14,126 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:00:14,150 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:00:14,507 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:00:14,507 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:00:14,544 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:00:14,720 INFO L232 lantSequenceWeakener]: Weakened 244 states. On average, predicates are now at 73.34% of their original sizes. [2018-09-19 06:00:14,720 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:00:15,490 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:00:15,491 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:00:15,491 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:00:15,491 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:00:15,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:00:15,492 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:00:15,492 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:00:15,492 INFO L87 Difference]: Start difference. First operand 3486 states and 4452 transitions. Second operand 10 states. [2018-09-19 06:00:17,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:00:17,499 INFO L93 Difference]: Finished difference Result 7025 states and 9137 transitions. [2018-09-19 06:00:17,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:00:17,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 247 [2018-09-19 06:00:17,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:00:17,519 INFO L225 Difference]: With dead ends: 7025 [2018-09-19 06:00:17,519 INFO L226 Difference]: Without dead ends: 3689 [2018-09-19 06:00:17,526 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 254 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:00:17,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2018-09-19 06:00:17,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3649. [2018-09-19 06:00:17,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3649 states. [2018-09-19 06:00:17,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 4696 transitions. [2018-09-19 06:00:17,593 INFO L78 Accepts]: Start accepts. Automaton has 3649 states and 4696 transitions. Word has length 247 [2018-09-19 06:00:17,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:00:17,594 INFO L480 AbstractCegarLoop]: Abstraction has 3649 states and 4696 transitions. [2018-09-19 06:00:17,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:00:17,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3649 states and 4696 transitions. [2018-09-19 06:00:17,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-09-19 06:00:17,601 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:00:17,601 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:00:17,602 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:00:17,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1705180960, now seen corresponding path program 1 times [2018-09-19 06:00:17,602 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:00:17,602 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 263 with the following transitions: [2018-09-19 06:00:17,603 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], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:00:17,605 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:00:17,605 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:00:17,629 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:00:17,826 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:00:17,826 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:00:17,854 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:00:18,009 INFO L232 lantSequenceWeakener]: Weakened 259 states. On average, predicates are now at 73.3% of their original sizes. [2018-09-19 06:00:18,009 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:00:18,147 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:00:18,148 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:00:18,148 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:00:18,148 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:00:18,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:00:18,149 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:00:18,149 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:00:18,149 INFO L87 Difference]: Start difference. First operand 3649 states and 4696 transitions. Second operand 10 states. [2018-09-19 06:00:20,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:00:20,609 INFO L93 Difference]: Finished difference Result 7322 states and 9594 transitions. [2018-09-19 06:00:20,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:00:20,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 262 [2018-09-19 06:00:20,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:00:20,628 INFO L225 Difference]: With dead ends: 7322 [2018-09-19 06:00:20,629 INFO L226 Difference]: Without dead ends: 3823 [2018-09-19 06:00:20,635 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 269 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:00:20,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3823 states. [2018-09-19 06:00:20,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3823 to 3806. [2018-09-19 06:00:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3806 states. [2018-09-19 06:00:20,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3806 states and 4906 transitions. [2018-09-19 06:00:20,703 INFO L78 Accepts]: Start accepts. Automaton has 3806 states and 4906 transitions. Word has length 262 [2018-09-19 06:00:20,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:00:20,703 INFO L480 AbstractCegarLoop]: Abstraction has 3806 states and 4906 transitions. [2018-09-19 06:00:20,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:00:20,704 INFO L276 IsEmpty]: Start isEmpty. Operand 3806 states and 4906 transitions. [2018-09-19 06:00:20,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-19 06:00:20,712 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:00:20,712 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:00:20,712 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:00:20,713 INFO L82 PathProgramCache]: Analyzing trace with hash 603304752, now seen corresponding path program 1 times [2018-09-19 06:00:20,713 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:00:20,713 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 277 with the following transitions: [2018-09-19 06:00:20,714 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], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [782], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:00:20,717 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:00:20,718 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:00:20,748 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:00:20,932 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:00:20,933 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:00:20,937 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:00:21,106 INFO L232 lantSequenceWeakener]: Weakened 273 states. On average, predicates are now at 73.27% of their original sizes. [2018-09-19 06:00:21,106 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:00:21,206 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:00:21,206 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:00:21,206 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:00:21,206 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:00:21,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:00:21,207 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:00:21,207 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:00:21,207 INFO L87 Difference]: Start difference. First operand 3806 states and 4906 transitions. Second operand 10 states. [2018-09-19 06:00:24,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:00:24,376 INFO L93 Difference]: Finished difference Result 8367 states and 11098 transitions. [2018-09-19 06:00:24,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:00:24,383 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 276 [2018-09-19 06:00:24,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:00:24,395 INFO L225 Difference]: With dead ends: 8367 [2018-09-19 06:00:24,396 INFO L226 Difference]: Without dead ends: 4711 [2018-09-19 06:00:24,403 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 283 GetRequests, 267 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:00:24,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4711 states. [2018-09-19 06:00:24,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4711 to 4649. [2018-09-19 06:00:24,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4649 states. [2018-09-19 06:00:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4649 states to 4649 states and 6018 transitions. [2018-09-19 06:00:24,496 INFO L78 Accepts]: Start accepts. Automaton has 4649 states and 6018 transitions. Word has length 276 [2018-09-19 06:00:24,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:00:24,497 INFO L480 AbstractCegarLoop]: Abstraction has 4649 states and 6018 transitions. [2018-09-19 06:00:24,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:00:24,497 INFO L276 IsEmpty]: Start isEmpty. Operand 4649 states and 6018 transitions. [2018-09-19 06:00:24,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-09-19 06:00:24,506 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:00:24,507 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:00:24,507 INFO L423 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:00:24,507 INFO L82 PathProgramCache]: Analyzing trace with hash -717343368, now seen corresponding path program 1 times [2018-09-19 06:00:24,507 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:00:24,507 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 285 with the following transitions: [2018-09-19 06:00:24,508 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], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [535], [538], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:00:24,510 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:00:24,510 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:00:24,535 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:00:24,662 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:00:24,662 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:00:24,697 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:00:24,864 INFO L232 lantSequenceWeakener]: Weakened 281 states. On average, predicates are now at 73.29% of their original sizes. [2018-09-19 06:00:24,864 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:00:25,006 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:00:25,007 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:00:25,007 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:00:25,007 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:00:25,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:00:25,007 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:00:25,007 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:00:25,008 INFO L87 Difference]: Start difference. First operand 4649 states and 6018 transitions. Second operand 10 states. [2018-09-19 06:00:27,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:00:27,259 INFO L93 Difference]: Finished difference Result 9531 states and 12530 transitions. [2018-09-19 06:00:27,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:00:27,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 284 [2018-09-19 06:00:27,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:00:27,273 INFO L225 Difference]: With dead ends: 9531 [2018-09-19 06:00:27,273 INFO L226 Difference]: Without dead ends: 5032 [2018-09-19 06:00:27,282 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 291 GetRequests, 275 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:00:27,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5032 states. [2018-09-19 06:00:27,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5032 to 4977. [2018-09-19 06:00:27,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4977 states. [2018-09-19 06:00:27,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4977 states to 4977 states and 6473 transitions. [2018-09-19 06:00:27,370 INFO L78 Accepts]: Start accepts. Automaton has 4977 states and 6473 transitions. Word has length 284 [2018-09-19 06:00:27,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:00:27,370 INFO L480 AbstractCegarLoop]: Abstraction has 4977 states and 6473 transitions. [2018-09-19 06:00:27,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:00:27,371 INFO L276 IsEmpty]: Start isEmpty. Operand 4977 states and 6473 transitions. [2018-09-19 06:00:27,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-09-19 06:00:27,381 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:00:27,382 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:00:27,382 INFO L423 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:00:27,382 INFO L82 PathProgramCache]: Analyzing trace with hash 912775296, now seen corresponding path program 1 times [2018-09-19 06:00:27,382 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:00:27,383 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 301 with the following transitions: [2018-09-19 06:00:27,383 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], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [562], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:00:27,385 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:00:27,385 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:00:27,411 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:00:32,110 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:00:32,111 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:00:32,118 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:00:33,297 INFO L232 lantSequenceWeakener]: Weakened 297 states. On average, predicates are now at 73.26% of their original sizes. [2018-09-19 06:00:33,298 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:00:33,648 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:00:33,648 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:00:33,649 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:00:33,649 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:00:33,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:00:33,649 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:00:33,650 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:00:33,650 INFO L87 Difference]: Start difference. First operand 4977 states and 6473 transitions. Second operand 10 states. [2018-09-19 06:00:36,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:00:36,257 INFO L93 Difference]: Finished difference Result 10225 states and 13506 transitions. [2018-09-19 06:00:36,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 06:00:36,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 300 [2018-09-19 06:00:36,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:00:36,278 INFO L225 Difference]: With dead ends: 10225 [2018-09-19 06:00:36,279 INFO L226 Difference]: Without dead ends: 5398 [2018-09-19 06:00:36,288 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 307 GetRequests, 291 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:00:36,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5398 states. [2018-09-19 06:00:36,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5398 to 5325. [2018-09-19 06:00:36,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5325 states. [2018-09-19 06:00:36,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5325 states to 5325 states and 6951 transitions. [2018-09-19 06:00:36,388 INFO L78 Accepts]: Start accepts. Automaton has 5325 states and 6951 transitions. Word has length 300 [2018-09-19 06:00:36,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:00:36,389 INFO L480 AbstractCegarLoop]: Abstraction has 5325 states and 6951 transitions. [2018-09-19 06:00:36,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:00:36,389 INFO L276 IsEmpty]: Start isEmpty. Operand 5325 states and 6951 transitions. [2018-09-19 06:00:36,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-09-19 06:00:36,400 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:00:36,401 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:00:36,401 INFO L423 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:00:36,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1614421556, now seen corresponding path program 1 times [2018-09-19 06:00:36,401 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:00:36,402 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 303 with the following transitions: [2018-09-19 06:00:36,402 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [610], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:00:36,404 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:00:36,404 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:00:36,429 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:00:36,739 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:00:36,739 INFO L272 AbstractInterpreter]: Visited 108 different actions 528 times. Merged at 8 different actions 32 times. Never widened. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:00:36,774 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:00:36,948 INFO L232 lantSequenceWeakener]: Weakened 299 states. On average, predicates are now at 73.26% of their original sizes. [2018-09-19 06:00:36,949 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:00:37,043 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:00:37,043 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:00:37,043 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:00:37,043 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:00:37,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:00:37,044 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:00:37,044 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:00:37,044 INFO L87 Difference]: Start difference. First operand 5325 states and 6951 transitions. Second operand 10 states. [2018-09-19 06:00:40,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:00:40,164 INFO L93 Difference]: Finished difference Result 12495 states and 16698 transitions. [2018-09-19 06:00:40,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:00:40,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 302 [2018-09-19 06:00:40,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:00:40,184 INFO L225 Difference]: With dead ends: 12495 [2018-09-19 06:00:40,184 INFO L226 Difference]: Without dead ends: 7320 [2018-09-19 06:00:40,196 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 309 GetRequests, 293 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:00:40,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7320 states. [2018-09-19 06:00:40,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7320 to 7265. [2018-09-19 06:00:40,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7265 states. [2018-09-19 06:00:40,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7265 states to 7265 states and 9556 transitions. [2018-09-19 06:00:40,327 INFO L78 Accepts]: Start accepts. Automaton has 7265 states and 9556 transitions. Word has length 302 [2018-09-19 06:00:40,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:00:40,327 INFO L480 AbstractCegarLoop]: Abstraction has 7265 states and 9556 transitions. [2018-09-19 06:00:40,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:00:40,327 INFO L276 IsEmpty]: Start isEmpty. Operand 7265 states and 9556 transitions. [2018-09-19 06:00:40,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-09-19 06:00:40,341 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:00:40,341 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, 3, 3, 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] [2018-09-19 06:00:40,342 INFO L423 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:00:40,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1428075604, now seen corresponding path program 1 times [2018-09-19 06:00:40,342 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:00:40,342 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 303 with the following transitions: [2018-09-19 06:00:40,343 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:00:40,345 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:00:40,345 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:00:40,374 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:00:40,523 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:00:40,524 INFO L272 AbstractInterpreter]: Visited 104 different actions 510 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:00:40,551 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:00:40,704 INFO L232 lantSequenceWeakener]: Weakened 299 states. On average, predicates are now at 73.26% of their original sizes. [2018-09-19 06:00:40,705 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:00:40,799 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:00:40,800 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:00:40,800 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:00:40,800 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:00:40,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:00:40,800 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:00:40,800 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:00:40,801 INFO L87 Difference]: Start difference. First operand 7265 states and 9556 transitions. Second operand 10 states. [2018-09-19 06:00:44,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:00:44,395 INFO L93 Difference]: Finished difference Result 16202 states and 21703 transitions. [2018-09-19 06:00:44,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:00:44,395 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 302 [2018-09-19 06:00:44,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:00:44,414 INFO L225 Difference]: With dead ends: 16202 [2018-09-19 06:00:44,414 INFO L226 Difference]: Without dead ends: 9087 [2018-09-19 06:00:44,426 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 309 GetRequests, 293 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:00:44,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9087 states. [2018-09-19 06:00:44,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9087 to 8821. [2018-09-19 06:00:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8821 states. [2018-09-19 06:00:44,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8821 states to 8821 states and 11487 transitions. [2018-09-19 06:00:44,584 INFO L78 Accepts]: Start accepts. Automaton has 8821 states and 11487 transitions. Word has length 302 [2018-09-19 06:00:44,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:00:44,585 INFO L480 AbstractCegarLoop]: Abstraction has 8821 states and 11487 transitions. [2018-09-19 06:00:44,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:00:44,585 INFO L276 IsEmpty]: Start isEmpty. Operand 8821 states and 11487 transitions. [2018-09-19 06:00:44,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-09-19 06:00:44,599 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:00:44,600 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:00:44,600 INFO L423 AbstractCegarLoop]: === Iteration 22 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:00:44,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1457324968, now seen corresponding path program 1 times [2018-09-19 06:00:44,600 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:00:44,601 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 313 with the following transitions: [2018-09-19 06:00:44,601 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], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [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:00:44,604 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:00:44,604 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:00:44,655 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:00:44,835 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:00:44,836 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:00:44,842 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:00:45,023 INFO L232 lantSequenceWeakener]: Weakened 309 states. On average, predicates are now at 73.21% of their original sizes. [2018-09-19 06:00:45,024 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:00:45,118 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:00:45,118 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:00:45,118 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:00:45,118 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:00:45,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:00:45,119 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:00:45,119 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:00:45,119 INFO L87 Difference]: Start difference. First operand 8821 states and 11487 transitions. Second operand 10 states. [2018-09-19 06:00:48,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:00:48,362 INFO L93 Difference]: Finished difference Result 18387 states and 24076 transitions. [2018-09-19 06:00:48,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:00:48,364 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 312 [2018-09-19 06:00:48,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:00:48,379 INFO L225 Difference]: With dead ends: 18387 [2018-09-19 06:00:48,380 INFO L226 Difference]: Without dead ends: 9716 [2018-09-19 06:00:48,391 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 319 GetRequests, 303 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:00:48,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9716 states. [2018-09-19 06:00:48,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9716 to 9552. [2018-09-19 06:00:48,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9552 states. [2018-09-19 06:00:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9552 states to 9552 states and 12465 transitions. [2018-09-19 06:00:48,557 INFO L78 Accepts]: Start accepts. Automaton has 9552 states and 12465 transitions. Word has length 312 [2018-09-19 06:00:48,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:00:48,557 INFO L480 AbstractCegarLoop]: Abstraction has 9552 states and 12465 transitions. [2018-09-19 06:00:48,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:00:48,557 INFO L276 IsEmpty]: Start isEmpty. Operand 9552 states and 12465 transitions. [2018-09-19 06:00:48,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-09-19 06:00:48,572 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:00:48,572 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:00:48,573 INFO L423 AbstractCegarLoop]: === Iteration 23 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:00:48,573 INFO L82 PathProgramCache]: Analyzing trace with hash 249467296, now seen corresponding path program 1 times [2018-09-19 06:00:48,573 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:00:48,573 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 321 with the following transitions: [2018-09-19 06:00:48,573 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], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [702], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:00:48,576 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:00:48,576 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:00:48,600 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:00:48,829 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:00:48,830 INFO L272 AbstractInterpreter]: Visited 131 different actions 774 times. Merged at 8 different actions 43 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:00:48,836 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:00:49,004 INFO L232 lantSequenceWeakener]: Weakened 317 states. On average, predicates are now at 73.23% of their original sizes. [2018-09-19 06:00:49,004 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:00:49,087 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:00:49,087 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:00:49,087 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:00:49,087 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:00:49,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:00:49,088 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:00:49,088 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:00:49,088 INFO L87 Difference]: Start difference. First operand 9552 states and 12465 transitions. Second operand 10 states. [2018-09-19 06:00:51,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:00:51,716 INFO L93 Difference]: Finished difference Result 19826 states and 26220 transitions. [2018-09-19 06:00:51,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:00:51,716 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 320 [2018-09-19 06:00:51,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:00:51,735 INFO L225 Difference]: With dead ends: 19826 [2018-09-19 06:00:51,735 INFO L226 Difference]: Without dead ends: 10424 [2018-09-19 06:00:51,745 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 327 GetRequests, 311 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:00:51,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10424 states. [2018-09-19 06:00:51,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10424 to 10350. [2018-09-19 06:00:51,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10350 states. [2018-09-19 06:00:51,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10350 states to 10350 states and 13664 transitions. [2018-09-19 06:00:51,914 INFO L78 Accepts]: Start accepts. Automaton has 10350 states and 13664 transitions. Word has length 320 [2018-09-19 06:00:51,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:00:51,914 INFO L480 AbstractCegarLoop]: Abstraction has 10350 states and 13664 transitions. [2018-09-19 06:00:51,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:00:51,914 INFO L276 IsEmpty]: Start isEmpty. Operand 10350 states and 13664 transitions. [2018-09-19 06:00:51,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-09-19 06:00:51,927 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:00:51,928 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, 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] [2018-09-19 06:00:51,928 INFO L423 AbstractCegarLoop]: === Iteration 24 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:00:51,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1062668620, now seen corresponding path program 1 times [2018-09-19 06:00:51,928 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:00:51,928 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 323 with the following transitions: [2018-09-19 06:00:51,929 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], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [562], [563], [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:00:51,931 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:00:51,931 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:00:51,956 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:00:52,198 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:00:52,198 INFO L272 AbstractInterpreter]: Visited 119 different actions 700 times. Merged at 8 different actions 41 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:00:52,227 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:00:52,428 INFO L232 lantSequenceWeakener]: Weakened 319 states. On average, predicates are now at 73.22% of their original sizes. [2018-09-19 06:00:52,429 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:00:52,559 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:00:52,560 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:00:52,560 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:00:52,560 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:00:52,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:00:52,561 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:00:52,561 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:00:52,561 INFO L87 Difference]: Start difference. First operand 10350 states and 13664 transitions. Second operand 10 states. [2018-09-19 06:00:54,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:00:54,638 INFO L93 Difference]: Finished difference Result 21036 states and 27952 transitions. [2018-09-19 06:00:54,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:00:54,639 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 322 [2018-09-19 06:00:54,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:00:54,663 INFO L225 Difference]: With dead ends: 21036 [2018-09-19 06:00:54,663 INFO L226 Difference]: Without dead ends: 10836 [2018-09-19 06:00:54,678 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 329 GetRequests, 313 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:00:54,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10836 states. [2018-09-19 06:00:54,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10836 to 10710. [2018-09-19 06:00:54,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10710 states. [2018-09-19 06:00:54,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10710 states to 10710 states and 14126 transitions. [2018-09-19 06:00:54,875 INFO L78 Accepts]: Start accepts. Automaton has 10710 states and 14126 transitions. Word has length 322 [2018-09-19 06:00:54,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:00:54,876 INFO L480 AbstractCegarLoop]: Abstraction has 10710 states and 14126 transitions. [2018-09-19 06:00:54,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:00:54,876 INFO L276 IsEmpty]: Start isEmpty. Operand 10710 states and 14126 transitions. [2018-09-19 06:00:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-09-19 06:00:54,890 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:00:54,890 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, 3, 3, 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] [2018-09-19 06:00:54,891 INFO L423 AbstractCegarLoop]: === Iteration 25 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:00:54,891 INFO L82 PathProgramCache]: Analyzing trace with hash -558064060, now seen corresponding path program 1 times [2018-09-19 06:00:54,891 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:00:54,891 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 323 with the following transitions: [2018-09-19 06:00:54,892 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], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [674], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:00:54,894 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:00:54,894 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:00:54,926 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:00:55,258 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:00:55,258 INFO L272 AbstractInterpreter]: Visited 124 different actions 732 times. Merged at 8 different actions 43 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:00:55,281 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:00:55,681 INFO L232 lantSequenceWeakener]: Weakened 319 states. On average, predicates are now at 73.22% of their original sizes. [2018-09-19 06:00:55,681 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:00:55,765 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:00:55,766 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:00:55,766 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:00:55,766 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:00:55,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:00:55,767 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:00:55,767 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:00:55,767 INFO L87 Difference]: Start difference. First operand 10710 states and 14126 transitions. Second operand 10 states. [2018-09-19 06:01:01,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:01:01,663 INFO L93 Difference]: Finished difference Result 22957 states and 30637 transitions. [2018-09-19 06:01:01,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:01:01,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 322 [2018-09-19 06:01:01,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:01:01,690 INFO L225 Difference]: With dead ends: 22957 [2018-09-19 06:01:01,690 INFO L226 Difference]: Without dead ends: 12397 [2018-09-19 06:01:01,706 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 329 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:01:01,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12397 states. [2018-09-19 06:01:01,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12397 to 12226. [2018-09-19 06:01:01,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12226 states. [2018-09-19 06:01:01,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12226 states to 12226 states and 16091 transitions. [2018-09-19 06:01:01,915 INFO L78 Accepts]: Start accepts. Automaton has 12226 states and 16091 transitions. Word has length 322 [2018-09-19 06:01:01,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:01:01,915 INFO L480 AbstractCegarLoop]: Abstraction has 12226 states and 16091 transitions. [2018-09-19 06:01:01,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:01:01,915 INFO L276 IsEmpty]: Start isEmpty. Operand 12226 states and 16091 transitions. [2018-09-19 06:01:01,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-09-19 06:01:01,934 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:01:01,934 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:01:01,934 INFO L423 AbstractCegarLoop]: === Iteration 26 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:01:01,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1829110860, now seen corresponding path program 1 times [2018-09-19 06:01:01,935 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:01:01,935 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 331 with the following transitions: [2018-09-19 06:01:01,935 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], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [542], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [706], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:01:01,938 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:01:01,938 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:01:01,963 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:01:02,160 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:01:02,161 INFO L272 AbstractInterpreter]: Visited 132 different actions 648 times. Merged at 8 different actions 32 times. Never widened. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:01:02,166 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:01:02,336 INFO L232 lantSequenceWeakener]: Weakened 327 states. On average, predicates are now at 73.21% of their original sizes. [2018-09-19 06:01:02,336 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:01:02,415 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:01:02,415 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:01:02,415 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:01:02,415 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:01:02,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:01:02,416 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:01:02,416 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:01:02,417 INFO L87 Difference]: Start difference. First operand 12226 states and 16091 transitions. Second operand 10 states. [2018-09-19 06:01:05,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:01:05,854 INFO L93 Difference]: Finished difference Result 27351 states and 36318 transitions. [2018-09-19 06:01:05,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 06:01:05,855 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 330 [2018-09-19 06:01:05,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:01:05,879 INFO L225 Difference]: With dead ends: 27351 [2018-09-19 06:01:05,879 INFO L226 Difference]: Without dead ends: 15275 [2018-09-19 06:01:05,896 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 337 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:01:05,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15275 states. [2018-09-19 06:01:06,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15275 to 15041. [2018-09-19 06:01:06,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15041 states. [2018-09-19 06:01:06,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15041 states to 15041 states and 19851 transitions. [2018-09-19 06:01:06,132 INFO L78 Accepts]: Start accepts. Automaton has 15041 states and 19851 transitions. Word has length 330 [2018-09-19 06:01:06,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:01:06,133 INFO L480 AbstractCegarLoop]: Abstraction has 15041 states and 19851 transitions. [2018-09-19 06:01:06,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:01:06,133 INFO L276 IsEmpty]: Start isEmpty. Operand 15041 states and 19851 transitions. [2018-09-19 06:01:06,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-09-19 06:01:06,141 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:01:06,142 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:01:06,142 INFO L423 AbstractCegarLoop]: === Iteration 27 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:01:06,142 INFO L82 PathProgramCache]: Analyzing trace with hash 295510171, now seen corresponding path program 1 times [2018-09-19 06:01:06,142 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:01:06,142 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 334 with the following transitions: [2018-09-19 06:01:06,143 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], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [694], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:01:06,145 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:01:06,145 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:01:06,167 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:01:08,630 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 06:01:08,630 INFO L272 AbstractInterpreter]: Visited 130 different actions 634 times. Merged at 8 different actions 32 times. Never widened. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:01:08,639 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 06:01:08,682 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 06:01:08,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 06:01:08 BoogieIcfgContainer [2018-09-19 06:01:08,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 06:01:08,683 INFO L168 Benchmark]: Toolchain (without parser) took 110087.42 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-19 06:01:08,685 INFO L168 Benchmark]: CDTParser took 0.23 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:01:08,685 INFO L168 Benchmark]: CACSL2BoogieTranslator took 820.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2018-09-19 06:01:08,686 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 06:01:08,687 INFO L168 Benchmark]: Boogie Preprocessor took 243.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 784.9 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -878.8 MB). Peak memory consumption was 30.1 MB. Max. memory is 7.1 GB. [2018-09-19 06:01:08,687 INFO L168 Benchmark]: RCFGBuilder took 3099.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 105.0 MB). Peak memory consumption was 105.0 MB. Max. memory is 7.1 GB. [2018-09-19 06:01:08,688 INFO L168 Benchmark]: TraceAbstraction took 105785.03 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.2 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-09-19 06:01:08,692 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 820.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 131.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 243.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 784.9 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -878.8 MB). Peak memory consumption was 30.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3099.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 105.0 MB). Peak memory consumption was 105.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 105785.03 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.2 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 145]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND TRUE ((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))) [L211] a1 = (((a1 + -15535) - 211896) / 5) [L212] a10 = 2 [L214] RET return 22; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND TRUE ((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14)) [L297] a1 = ((((((a1 * 9)/ 10) % 299993)+ -300005) / 5) + -75819) [L298] a10 = 4 [L300] RET return 26; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND TRUE ((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0))) [L449] a1 = ((((((a1 % 25)- -12) - 0) * 5) % 25)- -13) [L450] a10 = 3 [L451] a19 = 6 [L453] RET return -1; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND TRUE (((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)) [L145] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 105.7s OverallTime, 27 OverallIterations, 4 TraceHistogramMax, 74.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4771 SDtfs, 16340 SDslu, 9569 SDs, 0 SdLazy, 50340 SolverSat, 4651 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 60.0s Time, PredicateUnifierStatistics: 52 DeclaredPredicates, 6381 GetRequests, 5980 SyntacticMatches, 0 SemanticMatches, 401 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1001 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15041occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 16.3s AbstIntTime, 27 AbstIntIterations, 26 AbstIntStrong, 0.9968134526384343 AbsIntWeakeningRatio, 0.111254851228978 AbsIntAvgWeakeningVarsNumRemoved, 19.365782664941786 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 1619 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label00_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_06-01-08-707.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label00_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_06-01-08-707.csv Received shutdown request...