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_label52_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 06:04:53,646 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 06:04:53,648 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 06:04:53,661 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 06:04:53,661 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 06:04:53,662 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 06:04:53,663 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 06:04:53,665 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 06:04:53,667 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 06:04:53,668 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 06:04:53,669 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 06:04:53,669 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 06:04:53,670 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 06:04:53,671 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 06:04:53,673 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 06:04:53,674 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 06:04:53,674 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 06:04:53,676 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 06:04:53,682 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 06:04:53,684 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 06:04:53,685 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 06:04:53,686 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 06:04:53,689 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 06:04:53,689 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 06:04:53,689 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 06:04:53,690 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 06:04:53,691 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 06:04:53,692 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 06:04:53,693 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 06:04:53,694 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 06:04:53,694 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 06:04:53,695 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 06:04:53,695 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 06:04:53,695 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 06:04:53,696 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 06:04:53,697 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 06:04:53,697 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf [2018-09-19 06:04:53,713 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 06:04:53,713 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 06:04:53,714 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 06:04:53,714 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 06:04:53,714 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 06:04:53,715 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 06:04:53,715 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-19 06:04:53,715 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 06:04:53,715 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 06:04:53,715 INFO L133 SettingsManager]: * Abstract domain=IntervalDomain [2018-09-19 06:04:53,716 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 06:04:53,716 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 06:04:53,716 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 06:04:53,717 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 06:04:53,717 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 06:04:53,717 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 06:04:53,717 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 06:04:53,718 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 06:04:53,718 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 06:04:53,718 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 06:04:53,718 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 06:04:53,719 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 06:04:53,719 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 06:04:53,719 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 06:04:53,719 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 06:04:53,719 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 06:04:53,720 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 06:04:53,720 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 06:04:53,720 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 06:04:53,720 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 06:04:53,720 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 06:04:53,721 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 06:04:53,721 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 06:04:53,721 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 06:04:53,721 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 06:04:53,774 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 06:04:53,791 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 06:04:53,798 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 06:04:53,799 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 06:04:53,800 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 06:04:53,801 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label52_true-unreach-call.c [2018-09-19 06:04:54,181 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66832195a/2cdd9a7e399d4e05aea91c50f00453cd/FLAG3a6b23bed [2018-09-19 06:04:54,443 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 06:04:54,444 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label52_true-unreach-call.c [2018-09-19 06:04:54,458 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66832195a/2cdd9a7e399d4e05aea91c50f00453cd/FLAG3a6b23bed [2018-09-19 06:04:54,480 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66832195a/2cdd9a7e399d4e05aea91c50f00453cd [2018-09-19 06:04:54,492 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 06:04:54,495 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 06:04:54,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 06:04:54,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 06:04:54,504 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 06:04:54,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 06:04:54" (1/1) ... [2018-09-19 06:04:54,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600f763c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:54, skipping insertion in model container [2018-09-19 06:04:54,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 06:04:54" (1/1) ... [2018-09-19 06:04:54,522 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 06:04:55,000 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 06:04:55,018 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 06:04:55,097 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 06:04:55,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:55 WrapperNode [2018-09-19 06:04:55,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 06:04:55,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 06:04:55,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 06:04:55,151 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 06:04:55,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:55" (1/1) ... [2018-09-19 06:04:55,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:55" (1/1) ... [2018-09-19 06:04:55,277 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 06:04:55,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 06:04:55,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 06:04:55,278 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 06:04:55,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:55" (1/1) ... [2018-09-19 06:04:55,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:55" (1/1) ... [2018-09-19 06:04:55,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:55" (1/1) ... [2018-09-19 06:04:55,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:55" (1/1) ... [2018-09-19 06:04:55,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:55" (1/1) ... [2018-09-19 06:04:55,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:55" (1/1) ... [2018-09-19 06:04:55,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:55" (1/1) ... [2018-09-19 06:04:55,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 06:04:55,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 06:04:55,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 06:04:55,513 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 06:04:55,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 06:04:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 06:04:55,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 06:04:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 06:04:55,594 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 06:04:55,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 06:04:55,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 06:04:55,595 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 06:04:55,595 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 06:04:58,710 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 06:04:58,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 06:04:58 BoogieIcfgContainer [2018-09-19 06:04:58,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 06:04:58,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 06:04:58,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 06:04:58,715 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 06:04:58,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 06:04:54" (1/3) ... [2018-09-19 06:04:58,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c426a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 06:04:58, skipping insertion in model container [2018-09-19 06:04:58,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:55" (2/3) ... [2018-09-19 06:04:58,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c426a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 06:04:58, skipping insertion in model container [2018-09-19 06:04:58,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 06:04:58" (3/3) ... [2018-09-19 06:04:58,719 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label52_true-unreach-call.c [2018-09-19 06:04:58,730 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 06:04:58,739 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 06:04:58,794 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 06:04:58,795 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 06:04:58,795 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 06:04:58,795 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 06:04:58,796 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 06:04:58,796 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 06:04:58,797 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 06:04:58,797 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 06:04:58,797 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 06:04:58,825 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 06:04:58,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-19 06:04:58,836 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:58,837 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] [2018-09-19 06:04:58,838 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:58,843 INFO L82 PathProgramCache]: Analyzing trace with hash 919297452, now seen corresponding path program 1 times [2018-09-19 06:04:58,845 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:58,846 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-09-19 06:04:58,849 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], [285], [287], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 06:04:58,894 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:58,894 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:59,201 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:59,203 INFO L272 AbstractInterpreter]: Visited 47 different actions 47 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 06:04:59,249 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:59,408 INFO L232 lantSequenceWeakener]: Weakened 45 states. On average, predicates are now at 75.02% of their original sizes. [2018-09-19 06:04:59,408 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:59,668 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:59,672 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:59,673 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 06:04:59,673 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:59,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 06:04:59,686 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 06:04:59,687 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 06:04:59,690 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 06:05:02,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:02,944 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 06:05:02,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 06:05:02,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-09-19 06:05:02,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:02,965 INFO L225 Difference]: With dead ends: 576 [2018-09-19 06:05:02,965 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 06:05:02,973 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 06:05:02,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 06:05:03,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 06:05:03,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 06:05:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 06:05:03,043 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 48 [2018-09-19 06:05:03,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:03,044 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 06:05:03,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 06:05:03,045 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 06:05:03,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-09-19 06:05:03,051 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:03,052 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:05:03,052 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:03,053 INFO L82 PathProgramCache]: Analyzing trace with hash 445822331, now seen corresponding path program 1 times [2018-09-19 06:05:03,053 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:03,053 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 120 with the following transitions: [2018-09-19 06:05:03,055 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], [285], [287], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:03,062 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:03,064 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:03,169 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:03,316 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:03,316 INFO L272 AbstractInterpreter]: Visited 78 different actions 221 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:05:03,356 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:03,550 INFO L232 lantSequenceWeakener]: Weakened 116 states. On average, predicates are now at 73.7% of their original sizes. [2018-09-19 06:05:03,550 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:04,100 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:04,101 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:04,101 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:04,102 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:04,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:04,103 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:04,104 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:04,104 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 06:05:09,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:09,010 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 06:05:09,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 06:05:09,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 119 [2018-09-19 06:05:09,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:09,019 INFO L225 Difference]: With dead ends: 717 [2018-09-19 06:05:09,019 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 06:05:09,023 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 125 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:05:09,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 06:05:09,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 06:05:09,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 06:05:09,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 669 transitions. [2018-09-19 06:05:09,054 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 669 transitions. Word has length 119 [2018-09-19 06:05:09,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:09,055 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 669 transitions. [2018-09-19 06:05:09,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:09,055 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 669 transitions. [2018-09-19 06:05:09,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-19 06:05:09,059 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:09,060 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:05:09,060 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:09,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1298899392, now seen corresponding path program 1 times [2018-09-19 06:05:09,060 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:09,061 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 129 with the following transitions: [2018-09-19 06:05:09,061 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], [285], [287], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:09,064 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:09,065 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:09,110 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:09,176 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:09,176 INFO L272 AbstractInterpreter]: Visited 87 different actions 248 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:05:09,215 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:09,352 INFO L232 lantSequenceWeakener]: Weakened 125 states. On average, predicates are now at 73.63% of their original sizes. [2018-09-19 06:05:09,353 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:09,577 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:09,578 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:09,578 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:09,578 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:09,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:09,579 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:09,579 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:09,580 INFO L87 Difference]: Start difference. First operand 505 states and 669 transitions. Second operand 10 states. [2018-09-19 06:05:13,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:13,480 INFO L93 Difference]: Finished difference Result 1149 states and 1736 transitions. [2018-09-19 06:05:13,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:13,483 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 128 [2018-09-19 06:05:13,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:13,489 INFO L225 Difference]: With dead ends: 1149 [2018-09-19 06:05:13,489 INFO L226 Difference]: Without dead ends: 794 [2018-09-19 06:05:13,492 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 135 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:05:13,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-09-19 06:05:13,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 783. [2018-09-19 06:05:13,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-09-19 06:05:13,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1001 transitions. [2018-09-19 06:05:13,532 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1001 transitions. Word has length 128 [2018-09-19 06:05:13,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:13,533 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 1001 transitions. [2018-09-19 06:05:13,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:13,533 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1001 transitions. [2018-09-19 06:05:13,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-19 06:05:13,539 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:13,539 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:05:13,539 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:13,540 INFO L82 PathProgramCache]: Analyzing trace with hash -639538504, now seen corresponding path program 1 times [2018-09-19 06:05:13,540 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:13,540 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 165 with the following transitions: [2018-09-19 06:05:13,541 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], [285], [287], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:13,546 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:13,546 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:13,625 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:13,795 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:13,796 INFO L272 AbstractInterpreter]: Visited 123 different actions 356 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:05:13,817 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:13,981 INFO L232 lantSequenceWeakener]: Weakened 161 states. On average, predicates are now at 73.43% of their original sizes. [2018-09-19 06:05:13,982 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:14,167 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:14,167 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:14,167 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:14,168 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:14,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:14,169 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:14,169 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:14,170 INFO L87 Difference]: Start difference. First operand 783 states and 1001 transitions. Second operand 10 states. [2018-09-19 06:05:18,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:18,150 INFO L93 Difference]: Finished difference Result 1723 states and 2332 transitions. [2018-09-19 06:05:18,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 06:05:18,151 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 164 [2018-09-19 06:05:18,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:18,158 INFO L225 Difference]: With dead ends: 1723 [2018-09-19 06:05:18,158 INFO L226 Difference]: Without dead ends: 1090 [2018-09-19 06:05:18,161 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 170 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:05:18,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-09-19 06:05:18,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1081. [2018-09-19 06:05:18,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2018-09-19 06:05:18,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1351 transitions. [2018-09-19 06:05:18,196 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1351 transitions. Word has length 164 [2018-09-19 06:05:18,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:18,196 INFO L480 AbstractCegarLoop]: Abstraction has 1081 states and 1351 transitions. [2018-09-19 06:05:18,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:18,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1351 transitions. [2018-09-19 06:05:18,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-09-19 06:05:18,201 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:18,201 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:05:18,202 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:18,202 INFO L82 PathProgramCache]: Analyzing trace with hash 553277691, now seen corresponding path program 1 times [2018-09-19 06:05:18,202 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:18,202 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 184 with the following transitions: [2018-09-19 06:05:18,203 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], [285], [287], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:18,208 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:18,208 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:18,401 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:18,401 INFO L272 AbstractInterpreter]: Visited 142 different actions 413 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:05:18,427 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:18,549 INFO L232 lantSequenceWeakener]: Weakened 180 states. On average, predicates are now at 73.35% of their original sizes. [2018-09-19 06:05:18,550 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:18,672 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:18,672 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:18,672 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:18,672 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:18,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:18,673 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:18,673 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:18,673 INFO L87 Difference]: Start difference. First operand 1081 states and 1351 transitions. Second operand 10 states. [2018-09-19 06:05:20,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:20,274 INFO L93 Difference]: Finished difference Result 2464 states and 3201 transitions. [2018-09-19 06:05:20,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 06:05:20,285 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 183 [2018-09-19 06:05:20,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:20,294 INFO L225 Difference]: With dead ends: 2464 [2018-09-19 06:05:20,294 INFO L226 Difference]: Without dead ends: 1533 [2018-09-19 06:05:20,297 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 189 GetRequests, 174 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 06:05:20,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2018-09-19 06:05:20,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1521. [2018-09-19 06:05:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2018-09-19 06:05:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1842 transitions. [2018-09-19 06:05:20,344 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1842 transitions. Word has length 183 [2018-09-19 06:05:20,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:20,345 INFO L480 AbstractCegarLoop]: Abstraction has 1521 states and 1842 transitions. [2018-09-19 06:05:20,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:20,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1842 transitions. [2018-09-19 06:05:20,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-19 06:05:20,349 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:20,349 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:05:20,350 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:20,350 INFO L82 PathProgramCache]: Analyzing trace with hash -423655209, now seen corresponding path program 1 times [2018-09-19 06:05:20,350 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:20,350 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-09-19 06:05:20,351 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], [285], [287], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:20,359 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:20,359 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:20,393 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:20,464 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:20,464 INFO L272 AbstractInterpreter]: Visited 84 different actions 323 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:05:20,472 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:20,583 INFO L232 lantSequenceWeakener]: Weakened 192 states. On average, predicates are now at 73.36% of their original sizes. [2018-09-19 06:05:20,583 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:20,758 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:20,759 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:20,759 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:20,759 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:20,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:20,759 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:20,760 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:20,760 INFO L87 Difference]: Start difference. First operand 1521 states and 1842 transitions. Second operand 10 states. [2018-09-19 06:05:24,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:24,733 INFO L93 Difference]: Finished difference Result 3061 states and 3845 transitions. [2018-09-19 06:05:24,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:24,736 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 195 [2018-09-19 06:05:24,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:24,749 INFO L225 Difference]: With dead ends: 3061 [2018-09-19 06:05:24,749 INFO L226 Difference]: Without dead ends: 1690 [2018-09-19 06:05:24,758 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 202 GetRequests, 186 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:05:24,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2018-09-19 06:05:24,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1672. [2018-09-19 06:05:24,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-09-19 06:05:24,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2020 transitions. [2018-09-19 06:05:24,813 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2020 transitions. Word has length 195 [2018-09-19 06:05:24,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:24,814 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 2020 transitions. [2018-09-19 06:05:24,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:24,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2020 transitions. [2018-09-19 06:05:24,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-09-19 06:05:24,817 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:24,818 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:05:24,818 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:24,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1679044493, now seen corresponding path program 1 times [2018-09-19 06:05:24,818 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:24,819 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 198 with the following transitions: [2018-09-19 06:05:24,819 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], [285], [287], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [526], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:24,822 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:24,823 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:24,858 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:24,944 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:24,944 INFO L272 AbstractInterpreter]: Visited 86 different actions 332 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:05:24,981 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:25,088 INFO L232 lantSequenceWeakener]: Weakened 194 states. On average, predicates are now at 73.35% of their original sizes. [2018-09-19 06:05:25,088 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:25,410 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:25,410 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:25,410 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:25,411 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:25,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:25,411 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:25,411 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:25,412 INFO L87 Difference]: Start difference. First operand 1672 states and 2020 transitions. Second operand 10 states. [2018-09-19 06:05:26,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:26,955 INFO L93 Difference]: Finished difference Result 3362 states and 4211 transitions. [2018-09-19 06:05:26,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:26,956 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 197 [2018-09-19 06:05:26,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:26,964 INFO L225 Difference]: With dead ends: 3362 [2018-09-19 06:05:26,965 INFO L226 Difference]: Without dead ends: 1840 [2018-09-19 06:05:26,969 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 204 GetRequests, 188 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:05:26,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2018-09-19 06:05:27,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1823. [2018-09-19 06:05:27,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1823 states. [2018-09-19 06:05:27,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 2218 transitions. [2018-09-19 06:05:27,016 INFO L78 Accepts]: Start accepts. Automaton has 1823 states and 2218 transitions. Word has length 197 [2018-09-19 06:05:27,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:27,016 INFO L480 AbstractCegarLoop]: Abstraction has 1823 states and 2218 transitions. [2018-09-19 06:05:27,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:27,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 2218 transitions. [2018-09-19 06:05:27,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-09-19 06:05:27,020 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:27,020 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:05:27,021 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:27,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1591158869, now seen corresponding path program 1 times [2018-09-19 06:05:27,021 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:27,021 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2018-09-19 06:05:27,022 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], [285], [287], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [542], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:27,023 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:27,024 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:27,051 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:27,126 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:27,127 INFO L272 AbstractInterpreter]: Visited 90 different actions 348 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:05:27,131 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:27,253 INFO L232 lantSequenceWeakener]: Weakened 198 states. On average, predicates are now at 73.34% of their original sizes. [2018-09-19 06:05:27,253 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:27,397 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:27,397 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:27,398 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:27,398 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:27,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:27,398 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:27,398 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:27,399 INFO L87 Difference]: Start difference. First operand 1823 states and 2218 transitions. Second operand 10 states. [2018-09-19 06:05:30,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:30,166 INFO L93 Difference]: Finished difference Result 3819 states and 4796 transitions. [2018-09-19 06:05:30,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:30,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 201 [2018-09-19 06:05:30,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:30,178 INFO L225 Difference]: With dead ends: 3819 [2018-09-19 06:05:30,178 INFO L226 Difference]: Without dead ends: 2146 [2018-09-19 06:05:30,182 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 208 GetRequests, 192 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:05:30,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2018-09-19 06:05:30,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2123. [2018-09-19 06:05:30,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2123 states. [2018-09-19 06:05:30,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 2596 transitions. [2018-09-19 06:05:30,244 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 2596 transitions. Word has length 201 [2018-09-19 06:05:30,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:30,244 INFO L480 AbstractCegarLoop]: Abstraction has 2123 states and 2596 transitions. [2018-09-19 06:05:30,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:30,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 2596 transitions. [2018-09-19 06:05:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-09-19 06:05:30,248 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:30,248 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:05:30,249 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:30,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1147886723, now seen corresponding path program 1 times [2018-09-19 06:05:30,249 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:30,249 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2018-09-19 06:05:30,250 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], [285], [287], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:30,251 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:30,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:30,284 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:30,442 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:30,442 INFO L272 AbstractInterpreter]: Visited 88 different actions 340 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:05:30,480 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:30,615 INFO L232 lantSequenceWeakener]: Weakened 198 states. On average, predicates are now at 73.34% of their original sizes. [2018-09-19 06:05:30,615 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:30,840 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:30,840 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:30,840 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:30,840 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:30,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:30,841 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:30,841 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:30,841 INFO L87 Difference]: Start difference. First operand 2123 states and 2596 transitions. Second operand 10 states. [2018-09-19 06:05:33,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:33,982 INFO L93 Difference]: Finished difference Result 4418 states and 5553 transitions. [2018-09-19 06:05:33,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:33,987 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 201 [2018-09-19 06:05:33,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:33,997 INFO L225 Difference]: With dead ends: 4418 [2018-09-19 06:05:33,997 INFO L226 Difference]: Without dead ends: 2445 [2018-09-19 06:05:34,002 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 208 GetRequests, 192 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:05:34,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2018-09-19 06:05:34,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 2411. [2018-09-19 06:05:34,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2018-09-19 06:05:34,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2974 transitions. [2018-09-19 06:05:34,054 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2974 transitions. Word has length 201 [2018-09-19 06:05:34,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:34,054 INFO L480 AbstractCegarLoop]: Abstraction has 2411 states and 2974 transitions. [2018-09-19 06:05:34,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:34,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2974 transitions. [2018-09-19 06:05:34,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-09-19 06:05:34,061 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:34,061 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:05:34,061 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:34,061 INFO L82 PathProgramCache]: Analyzing trace with hash -519467393, now seen corresponding path program 1 times [2018-09-19 06:05:34,062 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:34,062 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 208 with the following transitions: [2018-09-19 06:05:34,062 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], [285], [287], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:34,065 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:34,065 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:34,092 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:36,435 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:36,436 INFO L272 AbstractInterpreter]: Visited 96 different actions 372 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:05:36,472 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:37,045 INFO L232 lantSequenceWeakener]: Weakened 204 states. On average, predicates are now at 73.32% of their original sizes. [2018-09-19 06:05:37,045 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:37,134 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:37,134 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:37,134 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:37,134 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:37,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:37,135 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:37,135 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:37,135 INFO L87 Difference]: Start difference. First operand 2411 states and 2974 transitions. Second operand 10 states. [2018-09-19 06:05:39,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:39,383 INFO L93 Difference]: Finished difference Result 4850 states and 6141 transitions. [2018-09-19 06:05:39,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:39,390 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 207 [2018-09-19 06:05:39,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:39,400 INFO L225 Difference]: With dead ends: 4850 [2018-09-19 06:05:39,400 INFO L226 Difference]: Without dead ends: 2589 [2018-09-19 06:05:39,405 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 06:05:39,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2018-09-19 06:05:39,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2566. [2018-09-19 06:05:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2566 states. [2018-09-19 06:05:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3192 transitions. [2018-09-19 06:05:39,523 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3192 transitions. Word has length 207 [2018-09-19 06:05:39,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:39,523 INFO L480 AbstractCegarLoop]: Abstraction has 2566 states and 3192 transitions. [2018-09-19 06:05:39,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:39,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3192 transitions. [2018-09-19 06:05:39,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-19 06:05:39,528 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:39,528 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, 2, 2, 2, 2, 2, 2, 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:05:39,528 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:39,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1475144184, now seen corresponding path program 1 times [2018-09-19 06:05:39,529 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:39,529 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-09-19 06:05:39,529 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], [285], [287], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [602], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:39,531 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:39,531 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:39,557 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:39,956 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:39,957 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:05:39,964 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:40,151 INFO L232 lantSequenceWeakener]: Weakened 213 states. On average, predicates are now at 73.3% of their original sizes. [2018-09-19 06:05:40,151 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:40,250 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:40,250 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:40,250 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:40,251 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:40,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:40,251 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:40,251 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:40,251 INFO L87 Difference]: Start difference. First operand 2566 states and 3192 transitions. Second operand 10 states. [2018-09-19 06:05:41,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:41,868 INFO L93 Difference]: Finished difference Result 5163 states and 6584 transitions. [2018-09-19 06:05:41,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:41,868 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 216 [2018-09-19 06:05:41,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:41,879 INFO L225 Difference]: With dead ends: 5163 [2018-09-19 06:05:41,879 INFO L226 Difference]: Without dead ends: 2747 [2018-09-19 06:05:41,885 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 223 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:05:41,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2018-09-19 06:05:41,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 2721. [2018-09-19 06:05:41,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2721 states. [2018-09-19 06:05:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2721 states to 2721 states and 3412 transitions. [2018-09-19 06:05:41,944 INFO L78 Accepts]: Start accepts. Automaton has 2721 states and 3412 transitions. Word has length 216 [2018-09-19 06:05:41,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:41,945 INFO L480 AbstractCegarLoop]: Abstraction has 2721 states and 3412 transitions. [2018-09-19 06:05:41,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2721 states and 3412 transitions. [2018-09-19 06:05:41,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-09-19 06:05:41,950 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:41,950 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, 2, 2, 2, 2, 2, 2, 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:05:41,951 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:41,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1996098700, now seen corresponding path program 1 times [2018-09-19 06:05:41,951 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:41,952 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 223 with the following transitions: [2018-09-19 06:05:41,952 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], [285], [287], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [626], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:41,954 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:41,954 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:41,979 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:42,091 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:42,092 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:05:42,129 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:42,250 INFO L232 lantSequenceWeakener]: Weakened 219 states. On average, predicates are now at 73.28% of their original sizes. [2018-09-19 06:05:42,250 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:42,350 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:42,350 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:42,350 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:42,350 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:42,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:42,351 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:42,351 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:42,351 INFO L87 Difference]: Start difference. First operand 2721 states and 3412 transitions. Second operand 10 states. [2018-09-19 06:05:45,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:45,111 INFO L93 Difference]: Finished difference Result 5472 states and 7022 transitions. [2018-09-19 06:05:45,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:45,113 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 222 [2018-09-19 06:05:45,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:45,124 INFO L225 Difference]: With dead ends: 5472 [2018-09-19 06:05:45,124 INFO L226 Difference]: Without dead ends: 2901 [2018-09-19 06:05:45,129 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:05:45,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2018-09-19 06:05:45,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2876. [2018-09-19 06:05:45,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2876 states. [2018-09-19 06:05:45,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 3624 transitions. [2018-09-19 06:05:45,190 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 3624 transitions. Word has length 222 [2018-09-19 06:05:45,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:45,191 INFO L480 AbstractCegarLoop]: Abstraction has 2876 states and 3624 transitions. [2018-09-19 06:05:45,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:45,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 3624 transitions. [2018-09-19 06:05:45,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-09-19 06:05:45,203 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:45,204 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, 2, 2, 2, 2, 2, 2, 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:05:45,204 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:45,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1325037005, now seen corresponding path program 1 times [2018-09-19 06:05:45,205 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:45,205 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 230 with the following transitions: [2018-09-19 06:05:45,206 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], [285], [287], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:45,208 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:45,209 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:45,237 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:45,393 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:45,393 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:05:45,430 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:45,571 INFO L232 lantSequenceWeakener]: Weakened 226 states. On average, predicates are now at 73.27% of their original sizes. [2018-09-19 06:05:45,572 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:45,774 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:45,774 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:45,775 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:45,775 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:45,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:45,776 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:45,776 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:45,776 INFO L87 Difference]: Start difference. First operand 2876 states and 3624 transitions. Second operand 10 states. [2018-09-19 06:05:50,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:50,317 INFO L93 Difference]: Finished difference Result 5959 states and 7691 transitions. [2018-09-19 06:05:50,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:50,318 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 229 [2018-09-19 06:05:50,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:50,327 INFO L225 Difference]: With dead ends: 5959 [2018-09-19 06:05:50,327 INFO L226 Difference]: Without dead ends: 3233 [2018-09-19 06:05:50,332 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 236 GetRequests, 220 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:05:50,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3233 states. [2018-09-19 06:05:50,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3233 to 3184. [2018-09-19 06:05:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3184 states. [2018-09-19 06:05:50,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 4030 transitions. [2018-09-19 06:05:50,401 INFO L78 Accepts]: Start accepts. Automaton has 3184 states and 4030 transitions. Word has length 229 [2018-09-19 06:05:50,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:50,402 INFO L480 AbstractCegarLoop]: Abstraction has 3184 states and 4030 transitions. [2018-09-19 06:05:50,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:50,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 4030 transitions. [2018-09-19 06:05:50,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-09-19 06:05:50,408 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:50,408 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, 2, 2, 2, 2, 2, 2, 2, 2, 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:05:50,409 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:50,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1671391477, now seen corresponding path program 1 times [2018-09-19 06:05:50,409 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:50,409 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 238 with the following transitions: [2018-09-19 06:05:50,410 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [285], [287], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:50,412 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:50,412 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:50,469 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:50,629 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:50,629 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:05:50,667 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:50,816 INFO L232 lantSequenceWeakener]: Weakened 234 states. On average, predicates are now at 73.25% of their original sizes. [2018-09-19 06:05:50,817 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:51,207 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:51,207 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:51,207 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:51,207 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:51,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:51,208 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:51,208 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:51,208 INFO L87 Difference]: Start difference. First operand 3184 states and 4030 transitions. Second operand 10 states. [2018-09-19 06:05:53,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:53,259 INFO L93 Difference]: Finished difference Result 6547 states and 8487 transitions. [2018-09-19 06:05:53,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:53,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 237 [2018-09-19 06:05:53,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:53,272 INFO L225 Difference]: With dead ends: 6547 [2018-09-19 06:05:53,273 INFO L226 Difference]: Without dead ends: 3513 [2018-09-19 06:05:53,279 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 244 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:05:53,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3513 states. [2018-09-19 06:05:53,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3513 to 3486. [2018-09-19 06:05:53,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3486 states. [2018-09-19 06:05:53,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 4452 transitions. [2018-09-19 06:05:53,349 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 4452 transitions. Word has length 237 [2018-09-19 06:05:53,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:53,350 INFO L480 AbstractCegarLoop]: Abstraction has 3486 states and 4452 transitions. [2018-09-19 06:05:53,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:53,350 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 4452 transitions. [2018-09-19 06:05:53,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-09-19 06:05:53,357 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:53,357 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, 2, 2, 2, 2, 2, 2, 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:05:53,357 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:53,357 INFO L82 PathProgramCache]: Analyzing trace with hash 650477531, now seen corresponding path program 1 times [2018-09-19 06:05:53,358 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:53,358 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 242 with the following transitions: [2018-09-19 06:05:53,358 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], [285], [287], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [702], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:53,360 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:53,361 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:53,386 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:53,613 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:53,613 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:05:53,649 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:53,901 INFO L232 lantSequenceWeakener]: Weakened 238 states. On average, predicates are now at 73.24% of their original sizes. [2018-09-19 06:05:53,901 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:53,984 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:53,984 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:53,984 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:53,985 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:53,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:53,985 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:53,985 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:53,986 INFO L87 Difference]: Start difference. First operand 3486 states and 4452 transitions. Second operand 10 states. [2018-09-19 06:05:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:56,497 INFO L93 Difference]: Finished difference Result 7025 states and 9137 transitions. [2018-09-19 06:05:56,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:56,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 241 [2018-09-19 06:05:56,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:56,523 INFO L225 Difference]: With dead ends: 7025 [2018-09-19 06:05:56,523 INFO L226 Difference]: Without dead ends: 3689 [2018-09-19 06:05:56,540 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 248 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:05:56,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2018-09-19 06:05:56,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3649. [2018-09-19 06:05:56,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3649 states. [2018-09-19 06:05:56,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 4696 transitions. [2018-09-19 06:05:56,613 INFO L78 Accepts]: Start accepts. Automaton has 3649 states and 4696 transitions. Word has length 241 [2018-09-19 06:05:56,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:56,613 INFO L480 AbstractCegarLoop]: Abstraction has 3649 states and 4696 transitions. [2018-09-19 06:05:56,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:56,614 INFO L276 IsEmpty]: Start isEmpty. Operand 3649 states and 4696 transitions. [2018-09-19 06:05:56,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-19 06:05:56,621 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:56,622 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, 2, 2, 2, 2, 2, 2, 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:05:56,622 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:56,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1896868648, now seen corresponding path program 1 times [2018-09-19 06:05:56,622 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:56,623 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 257 with the following transitions: [2018-09-19 06:05:56,623 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [285], [287], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:56,626 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:56,626 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:56,652 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:56,864 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:56,864 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:05:56,889 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:57,054 INFO L232 lantSequenceWeakener]: Weakened 253 states. On average, predicates are now at 73.21% of their original sizes. [2018-09-19 06:05:57,055 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:57,643 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:57,643 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:57,643 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:57,644 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:57,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:57,644 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:57,644 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:57,645 INFO L87 Difference]: Start difference. First operand 3649 states and 4696 transitions. Second operand 10 states. [2018-09-19 06:05:59,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:59,656 INFO L93 Difference]: Finished difference Result 7322 states and 9594 transitions. [2018-09-19 06:05:59,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:59,657 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 256 [2018-09-19 06:05:59,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:59,668 INFO L225 Difference]: With dead ends: 7322 [2018-09-19 06:05:59,668 INFO L226 Difference]: Without dead ends: 3823 [2018-09-19 06:05:59,675 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 263 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:05:59,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3823 states. [2018-09-19 06:05:59,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3823 to 3806. [2018-09-19 06:05:59,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3806 states. [2018-09-19 06:05:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3806 states and 4906 transitions. [2018-09-19 06:05:59,738 INFO L78 Accepts]: Start accepts. Automaton has 3806 states and 4906 transitions. Word has length 256 [2018-09-19 06:05:59,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:59,738 INFO L480 AbstractCegarLoop]: Abstraction has 3806 states and 4906 transitions. [2018-09-19 06:05:59,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:59,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3806 states and 4906 transitions. [2018-09-19 06:05:59,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-09-19 06:05:59,745 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:59,745 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:05:59,746 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:59,746 INFO L82 PathProgramCache]: Analyzing trace with hash -971612168, now seen corresponding path program 1 times [2018-09-19 06:05:59,746 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:59,746 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 271 with the following transitions: [2018-09-19 06:05:59,747 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], [285], [287], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [782], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:59,749 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:59,749 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:59,781 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:06:00,025 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 06:06:00,026 INFO L272 AbstractInterpreter]: Visited 151 different actions 588 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:06:00,063 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 06:06:00,124 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 06:06:00,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 06:06:00 BoogieIcfgContainer [2018-09-19 06:06:00,125 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 06:06:00,126 INFO L168 Benchmark]: Toolchain (without parser) took 65633.24 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -442.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-09-19 06:06:00,129 INFO L168 Benchmark]: CDTParser took 0.26 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:06:00,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 653.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-19 06:06:00,131 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.78 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:06:00,132 INFO L168 Benchmark]: Boogie Preprocessor took 234.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -856.4 MB). Peak memory consumption was 30.1 MB. Max. memory is 7.1 GB. [2018-09-19 06:06:00,133 INFO L168 Benchmark]: RCFGBuilder took 3198.09 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 123.4 MB). Peak memory consumption was 123.4 MB. Max. memory is 7.1 GB. [2018-09-19 06:06:00,134 INFO L168 Benchmark]: TraceAbstraction took 61412.87 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 804.3 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 248.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-09-19 06:06:00,144 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.26 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 653.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 126.78 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 234.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -856.4 MB). Peak memory consumption was 30.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3198.09 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 123.4 MB). Peak memory consumption was 123.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 61412.87 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 804.3 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 248.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 127]: 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 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 TRUE (((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)) [L255] a1 = (((a1 / 5) + 110755) + 220746) [L256] a10 = 1 [L257] a19 = 8 [L259] RET return -1; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L481] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) [L487] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) [L493] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) [L499] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) [L504] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) [L509] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) [L514] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) [L517] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) [L523] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) [L526] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) [L529] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) [L534] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) [L540] COND FALSE !(((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0)))) [L545] COND FALSE !(((a4==14) && (((a12==0) && ((a19==9) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a10==4)))) [L548] COND FALSE !(((((( ((38 < a1) && (218 >= a1)) && (input == 3)) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10))) [L554] COND FALSE !((((a4==14) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 4)) && (a12==0)) && (a19==9))) && (a10==2))) [L557] COND TRUE ((a12==0) && ((( 218 < a1 && ((a19==9) && (input == 5))) && (a10==1)) && (a4==14))) [L558] a1 = ((((a1 * 9)/ 10) + 58620) - 603783) [L559] a10 = 4 [L560] a19 = 8 [L562] 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 TRUE (((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)) [L127] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 61.3s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 47.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3092 SDtfs, 9736 SDslu, 5058 SDs, 0 SdLazy, 26925 SolverSat, 2471 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 39.0s Time, PredicateUnifierStatistics: 32 DeclaredPredicates, 3145 GetRequests, 2904 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3806occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.3s AbstIntTime, 17 AbstIntIterations, 16 AbstIntStrong, 0.9966473650409088 AbsIntWeakeningRatio, 0.12549537648612946 AbsIntAvgWeakeningVarsNumRemoved, 19.11426684280053 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 339 StatesRemovedByMinimization, 16 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_label52_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_06-06-00-173.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label52_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_06-06-00-173.csv Received shutdown request...