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_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label25_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 03:27:27,818 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 03:27:27,822 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 03:27:27,839 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 03:27:27,840 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 03:27:27,842 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 03:27:27,843 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 03:27:27,845 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 03:27:27,847 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 03:27:27,848 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 03:27:27,848 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 03:27:27,849 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 03:27:27,850 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 03:27:27,851 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 03:27:27,852 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 03:27:27,852 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 03:27:27,853 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 03:27:27,855 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 03:27:27,857 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 03:27:27,859 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 03:27:27,860 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 03:27:27,861 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 03:27:27,864 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 03:27:27,864 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 03:27:27,864 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 03:27:27,865 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 03:27:27,866 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 03:27:27,867 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 03:27:27,868 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 03:27:27,869 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 03:27:27,869 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 03:27:27,870 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 03:27:27,870 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 03:27:27,870 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 03:27:27,871 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 03:27:27,872 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 03:27:27,872 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf [2018-09-19 03:27:27,897 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 03:27:27,897 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 03:27:27,898 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 03:27:27,898 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 03:27:27,898 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 03:27:27,899 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 03:27:27,899 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 03:27:27,899 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 03:27:27,899 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 03:27:27,899 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 03:27:27,900 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 03:27:27,900 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 03:27:27,900 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 03:27:27,901 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 03:27:27,901 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 03:27:27,901 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 03:27:27,901 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 03:27:27,901 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 03:27:27,902 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 03:27:27,902 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 03:27:27,902 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 03:27:27,902 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 03:27:27,902 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 03:27:27,903 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 03:27:27,903 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 03:27:27,903 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 03:27:27,903 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 03:27:27,903 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 03:27:27,904 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 03:27:27,904 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 03:27:27,904 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 03:27:27,904 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 03:27:27,904 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 03:27:27,904 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 03:27:27,951 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 03:27:27,964 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 03:27:27,968 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 03:27:27,970 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 03:27:27,970 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 03:27:27,971 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label25_true-unreach-call.c [2018-09-19 03:27:28,324 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b7724b2a/7ae6a29476c54d438c06eb43fd349c72/FLAG5f2a2451d [2018-09-19 03:27:28,650 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 03:27:28,652 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label25_true-unreach-call.c [2018-09-19 03:27:28,665 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b7724b2a/7ae6a29476c54d438c06eb43fd349c72/FLAG5f2a2451d [2018-09-19 03:27:28,682 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b7724b2a/7ae6a29476c54d438c06eb43fd349c72 [2018-09-19 03:27:28,693 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 03:27:28,697 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 03:27:28,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 03:27:28,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 03:27:28,705 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 03:27:28,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:27:28" (1/1) ... [2018-09-19 03:27:28,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64024991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:28, skipping insertion in model container [2018-09-19 03:27:28,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:27:28" (1/1) ... [2018-09-19 03:27:28,723 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 03:27:29,195 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 03:27:29,215 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 03:27:29,337 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 03:27:29,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:29 WrapperNode [2018-09-19 03:27:29,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 03:27:29,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 03:27:29,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 03:27:29,399 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 03:27:29,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:29" (1/1) ... [2018-09-19 03:27:29,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:29" (1/1) ... [2018-09-19 03:27:29,490 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 03:27:29,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 03:27:29,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 03:27:29,491 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 03:27:29,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:29" (1/1) ... [2018-09-19 03:27:29,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:29" (1/1) ... [2018-09-19 03:27:29,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:29" (1/1) ... [2018-09-19 03:27:29,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:29" (1/1) ... [2018-09-19 03:27:29,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:29" (1/1) ... [2018-09-19 03:27:29,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:29" (1/1) ... [2018-09-19 03:27:29,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:29" (1/1) ... [2018-09-19 03:27:29,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 03:27:29,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 03:27:29,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 03:27:29,766 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 03:27:29,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:29" (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 03:27:29,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 03:27:29,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 03:27:29,861 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 03:27:29,861 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 03:27:29,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 03:27:29,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 03:27:29,862 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 03:27:29,862 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 03:27:33,309 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 03:27:33,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:27:33 BoogieIcfgContainer [2018-09-19 03:27:33,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 03:27:33,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 03:27:33,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 03:27:33,316 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 03:27:33,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:27:28" (1/3) ... [2018-09-19 03:27:33,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6becd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:27:33, skipping insertion in model container [2018-09-19 03:27:33,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:29" (2/3) ... [2018-09-19 03:27:33,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6becd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:27:33, skipping insertion in model container [2018-09-19 03:27:33,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:27:33" (3/3) ... [2018-09-19 03:27:33,321 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label25_true-unreach-call.c [2018-09-19 03:27:33,333 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 03:27:33,346 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 03:27:33,408 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 03:27:33,409 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 03:27:33,409 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 03:27:33,410 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 03:27:33,410 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 03:27:33,410 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 03:27:33,410 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 03:27:33,411 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 03:27:33,411 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 03:27:33,444 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 03:27:33,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-19 03:27:33,457 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:27:33,458 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:27:33,460 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:27:33,465 INFO L82 PathProgramCache]: Analyzing trace with hash 382760497, now seen corresponding path program 1 times [2018-09-19 03:27:33,467 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:27:33,468 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 72 with the following transitions: [2018-09-19 03:27:33,471 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 03:27:33,547 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:27:33,547 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:27:35,807 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:27:35,809 INFO L272 AbstractInterpreter]: Visited 70 different actions 70 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 03:27:35,825 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:27:36,749 INFO L232 lantSequenceWeakener]: Weakened 69 states. On average, predicates are now at 76.14% of their original sizes. [2018-09-19 03:27:36,749 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:27:37,070 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:27:37,072 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:27:37,072 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 03:27:37,072 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:27:37,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 03:27:37,089 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 03:27:37,090 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 03:27:37,093 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 03:27:41,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:27:41,800 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 03:27:41,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 03:27:41,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-09-19 03:27:41,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:27:41,827 INFO L225 Difference]: With dead ends: 576 [2018-09-19 03:27:41,827 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 03:27:41,833 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 03:27:41,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 03:27:41,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 03:27:41,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 03:27:41,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 03:27:41,907 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 71 [2018-09-19 03:27:41,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:27:41,910 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 03:27:41,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 03:27:41,910 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 03:27:41,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-19 03:27:41,921 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:27:41,921 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:27:41,925 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:27:41,925 INFO L82 PathProgramCache]: Analyzing trace with hash 793000707, now seen corresponding path program 1 times [2018-09-19 03:27:41,925 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:27:41,926 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 143 with the following transitions: [2018-09-19 03:27:41,926 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:27:41,940 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:27:41,940 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:27:43,664 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:27:46,759 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:27:46,759 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 03:27:46,781 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:27:47,988 INFO L232 lantSequenceWeakener]: Weakened 140 states. On average, predicates are now at 74.47% of their original sizes. [2018-09-19 03:27:47,989 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:27:48,784 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:27:48,784 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:27:48,784 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 03:27:48,785 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:27:48,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 03:27:48,786 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 03:27:48,786 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 03:27:48,787 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 03:27:53,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:27:53,932 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 03:27:53,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 03:27:53,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 142 [2018-09-19 03:27:53,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:27:53,941 INFO L225 Difference]: With dead ends: 717 [2018-09-19 03:27:53,942 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 03:27:53,944 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 148 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 03:27:53,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 03:27:53,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 03:27:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 03:27:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 659 transitions. [2018-09-19 03:27:53,987 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 659 transitions. Word has length 142 [2018-09-19 03:27:53,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:27:53,988 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 659 transitions. [2018-09-19 03:27:53,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 03:27:53,988 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 659 transitions. [2018-09-19 03:27:53,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-09-19 03:27:53,992 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:27:53,992 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:27:53,993 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:27:53,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1467562684, now seen corresponding path program 1 times [2018-09-19 03:27:53,993 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:27:53,993 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-09-19 03:27:53,994 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:27:53,999 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:27:53,999 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:27:58,878 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:28:01,143 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:28:01,144 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 03:28:01,169 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:28:02,440 INFO L232 lantSequenceWeakener]: Weakened 149 states. On average, predicates are now at 74.37% of their original sizes. [2018-09-19 03:28:02,441 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:28:03,700 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:28:03,701 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:28:03,701 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:28:03,701 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:28:03,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:28:03,702 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:28:03,702 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:28:03,703 INFO L87 Difference]: Start difference. First operand 505 states and 659 transitions. Second operand 13 states. [2018-09-19 03:28:12,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:28:12,705 INFO L93 Difference]: Finished difference Result 1333 states and 2076 transitions. [2018-09-19 03:28:12,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-19 03:28:12,706 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 151 [2018-09-19 03:28:12,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:28:12,715 INFO L225 Difference]: With dead ends: 1333 [2018-09-19 03:28:12,715 INFO L226 Difference]: Without dead ends: 978 [2018-09-19 03:28:12,718 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 165 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2018-09-19 03:28:12,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2018-09-19 03:28:12,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 762. [2018-09-19 03:28:12,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-09-19 03:28:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 943 transitions. [2018-09-19 03:28:12,773 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 943 transitions. Word has length 151 [2018-09-19 03:28:12,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:28:12,774 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 943 transitions. [2018-09-19 03:28:12,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:28:12,774 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 943 transitions. [2018-09-19 03:28:12,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-09-19 03:28:12,781 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:28:12,782 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:28:12,782 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:28:12,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1455651900, now seen corresponding path program 1 times [2018-09-19 03:28:12,783 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:28:12,783 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 188 with the following transitions: [2018-09-19 03:28:12,783 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:28:12,792 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:28:12,792 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:28:15,270 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:28:20,963 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:28:20,964 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 03:28:20,971 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:28:22,086 INFO L232 lantSequenceWeakener]: Weakened 185 states. On average, predicates are now at 74.05% of their original sizes. [2018-09-19 03:28:22,087 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:28:22,479 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:28:22,479 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:28:22,479 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 03:28:22,480 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:28:22,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 03:28:22,481 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 03:28:22,481 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 03:28:22,481 INFO L87 Difference]: Start difference. First operand 762 states and 943 transitions. Second operand 12 states. [2018-09-19 03:28:27,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:28:27,845 INFO L93 Difference]: Finished difference Result 1677 states and 2200 transitions. [2018-09-19 03:28:27,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 03:28:27,846 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 187 [2018-09-19 03:28:27,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:28:27,853 INFO L225 Difference]: With dead ends: 1677 [2018-09-19 03:28:27,853 INFO L226 Difference]: Without dead ends: 1067 [2018-09-19 03:28:27,856 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 195 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-09-19 03:28:27,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2018-09-19 03:28:27,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1056. [2018-09-19 03:28:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2018-09-19 03:28:27,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1277 transitions. [2018-09-19 03:28:27,900 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1277 transitions. Word has length 187 [2018-09-19 03:28:27,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:28:27,901 INFO L480 AbstractCegarLoop]: Abstraction has 1056 states and 1277 transitions. [2018-09-19 03:28:27,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 03:28:27,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1277 transitions. [2018-09-19 03:28:27,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-19 03:28:27,905 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:28:27,905 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:28:27,905 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:28:27,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1125130115, now seen corresponding path program 1 times [2018-09-19 03:28:27,906 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:28:27,906 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 207 with the following transitions: [2018-09-19 03:28:27,907 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:28:27,913 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:28:27,913 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:28:37,616 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:28:37,616 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 03:28:37,622 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:28:38,974 INFO L232 lantSequenceWeakener]: Weakened 204 states. On average, predicates are now at 73.93% of their original sizes. [2018-09-19 03:28:38,975 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:28:39,493 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:28:39,494 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:28:39,494 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 03:28:39,494 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:28:39,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 03:28:39,495 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 03:28:39,495 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 03:28:39,496 INFO L87 Difference]: Start difference. First operand 1056 states and 1277 transitions. Second operand 12 states. [2018-09-19 03:28:48,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:28:48,179 INFO L93 Difference]: Finished difference Result 2268 states and 2879 transitions. [2018-09-19 03:28:48,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-19 03:28:48,182 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 206 [2018-09-19 03:28:48,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:28:48,191 INFO L225 Difference]: With dead ends: 2268 [2018-09-19 03:28:48,191 INFO L226 Difference]: Without dead ends: 1364 [2018-09-19 03:28:48,194 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 215 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-09-19 03:28:48,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2018-09-19 03:28:48,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1352. [2018-09-19 03:28:48,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-09-19 03:28:48,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1605 transitions. [2018-09-19 03:28:48,260 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1605 transitions. Word has length 206 [2018-09-19 03:28:48,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:28:48,260 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1605 transitions. [2018-09-19 03:28:48,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 03:28:48,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1605 transitions. [2018-09-19 03:28:48,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-09-19 03:28:48,265 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:28:48,265 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:28:48,265 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:28:48,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1512083002, now seen corresponding path program 1 times [2018-09-19 03:28:48,266 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:28:48,266 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 219 with the following transitions: [2018-09-19 03:28:48,267 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:28:48,279 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:28:48,280 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:28:49,798 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:28:55,952 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:28:55,952 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 03:28:55,997 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:28:57,238 INFO L232 lantSequenceWeakener]: Weakened 216 states. On average, predicates are now at 73.9% of their original sizes. [2018-09-19 03:28:57,238 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:28:57,543 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:28:57,543 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:28:57,543 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 03:28:57,543 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:28:57,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 03:28:57,544 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 03:28:57,544 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 03:28:57,545 INFO L87 Difference]: Start difference. First operand 1352 states and 1605 transitions. Second operand 10 states. [2018-09-19 03:29:03,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:29:03,235 INFO L93 Difference]: Finished difference Result 2719 states and 3368 transitions. [2018-09-19 03:29:03,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 03:29:03,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 218 [2018-09-19 03:29:03,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:29:03,243 INFO L225 Difference]: With dead ends: 2719 [2018-09-19 03:29:03,243 INFO L226 Difference]: Without dead ends: 1521 [2018-09-19 03:29:03,246 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 225 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 03:29:03,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2018-09-19 03:29:03,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1503. [2018-09-19 03:29:03,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2018-09-19 03:29:03,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1772 transitions. [2018-09-19 03:29:03,301 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1772 transitions. Word has length 218 [2018-09-19 03:29:03,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:29:03,301 INFO L480 AbstractCegarLoop]: Abstraction has 1503 states and 1772 transitions. [2018-09-19 03:29:03,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 03:29:03,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1772 transitions. [2018-09-19 03:29:03,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-09-19 03:29:03,306 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:29:03,306 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:29:03,306 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:29:03,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1407144611, now seen corresponding path program 1 times [2018-09-19 03:29:03,307 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:29:03,307 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 230 with the following transitions: [2018-09-19 03:29:03,307 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:29:03,310 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:29:03,310 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:29:06,363 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:29:10,399 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:29:10,400 INFO L272 AbstractInterpreter]: Visited 88 different actions 341 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 03:29:10,408 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:29:11,686 INFO L232 lantSequenceWeakener]: Weakened 227 states. On average, predicates are now at 73.84% of their original sizes. [2018-09-19 03:29:11,686 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:29:12,178 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:29:12,179 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:29:12,179 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:29:12,179 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:29:12,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:29:12,180 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:29:12,181 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:29:12,181 INFO L87 Difference]: Start difference. First operand 1503 states and 1772 transitions. Second operand 13 states. [2018-09-19 03:29:20,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:29:20,349 INFO L93 Difference]: Finished difference Result 3686 states and 4637 transitions. [2018-09-19 03:29:20,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:29:20,350 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 229 [2018-09-19 03:29:20,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:29:20,366 INFO L225 Difference]: With dead ends: 3686 [2018-09-19 03:29:20,367 INFO L226 Difference]: Without dead ends: 2337 [2018-09-19 03:29:20,373 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 241 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-19 03:29:20,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2018-09-19 03:29:20,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2189. [2018-09-19 03:29:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2189 states. [2018-09-19 03:29:20,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 2615 transitions. [2018-09-19 03:29:20,475 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 2615 transitions. Word has length 229 [2018-09-19 03:29:20,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:29:20,477 INFO L480 AbstractCegarLoop]: Abstraction has 2189 states and 2615 transitions. [2018-09-19 03:29:20,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:29:20,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 2615 transitions. [2018-09-19 03:29:20,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-09-19 03:29:20,484 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:29:20,484 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:29:20,484 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:29:20,485 INFO L82 PathProgramCache]: Analyzing trace with hash -100582441, now seen corresponding path program 1 times [2018-09-19 03:29:20,485 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:29:20,485 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 240 with the following transitions: [2018-09-19 03:29:20,486 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:29:20,489 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:29:20,489 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:29:24,433 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:29:37,503 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:29:37,503 INFO L272 AbstractInterpreter]: Visited 96 different actions 555 times. Merged at 7 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:29:37,512 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:29:39,364 INFO L232 lantSequenceWeakener]: Weakened 237 states. On average, predicates are now at 73.8% of their original sizes. [2018-09-19 03:29:39,365 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:29:39,885 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:29:39,885 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:29:39,885 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:29:39,885 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:29:39,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:29:39,886 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:29:39,887 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:29:39,887 INFO L87 Difference]: Start difference. First operand 2189 states and 2615 transitions. Second operand 13 states. [2018-09-19 03:29:51,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:29:51,646 INFO L93 Difference]: Finished difference Result 5360 states and 6747 transitions. [2018-09-19 03:29:51,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:29:51,650 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 239 [2018-09-19 03:29:51,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:29:51,669 INFO L225 Difference]: With dead ends: 5360 [2018-09-19 03:29:51,670 INFO L226 Difference]: Without dead ends: 3325 [2018-09-19 03:29:51,676 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 251 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-19 03:29:51,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3325 states. [2018-09-19 03:29:51,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3325 to 3019. [2018-09-19 03:29:51,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3019 states. [2018-09-19 03:29:51,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 3715 transitions. [2018-09-19 03:29:51,805 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 3715 transitions. Word has length 239 [2018-09-19 03:29:51,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:29:51,811 INFO L480 AbstractCegarLoop]: Abstraction has 3019 states and 3715 transitions. [2018-09-19 03:29:51,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:29:51,812 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3715 transitions. [2018-09-19 03:29:51,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-09-19 03:29:51,818 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:29:51,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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:29:51,818 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:29:51,819 INFO L82 PathProgramCache]: Analyzing trace with hash -2128503195, now seen corresponding path program 1 times [2018-09-19 03:29:51,819 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:29:51,819 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 256 with the following transitions: [2018-09-19 03:29:51,820 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:29:51,823 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:29:51,823 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:29:53,312 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:30:02,237 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:30:02,237 INFO L272 AbstractInterpreter]: Visited 121 different actions 471 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 03:30:02,247 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:30:03,716 INFO L232 lantSequenceWeakener]: Weakened 253 states. On average, predicates are now at 73.73% of their original sizes. [2018-09-19 03:30:03,716 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:30:04,225 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:30:04,225 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:30:04,225 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:30:04,226 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:30:04,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:30:04,226 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:30:04,226 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:30:04,226 INFO L87 Difference]: Start difference. First operand 3019 states and 3715 transitions. Second operand 13 states. [2018-09-19 03:30:15,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:30:15,063 INFO L93 Difference]: Finished difference Result 6300 states and 8063 transitions. [2018-09-19 03:30:15,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:30:15,067 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 255 [2018-09-19 03:30:15,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:30:15,083 INFO L225 Difference]: With dead ends: 6300 [2018-09-19 03:30:15,084 INFO L226 Difference]: Without dead ends: 3435 [2018-09-19 03:30:15,092 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 267 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-19 03:30:15,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2018-09-19 03:30:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3305. [2018-09-19 03:30:15,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3305 states. [2018-09-19 03:30:15,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 4062 transitions. [2018-09-19 03:30:15,207 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 4062 transitions. Word has length 255 [2018-09-19 03:30:15,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:30:15,208 INFO L480 AbstractCegarLoop]: Abstraction has 3305 states and 4062 transitions. [2018-09-19 03:30:15,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:30:15,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 4062 transitions. [2018-09-19 03:30:15,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-19 03:30:15,216 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:30:15,216 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:30:15,217 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:30:15,217 INFO L82 PathProgramCache]: Analyzing trace with hash 2060148212, now seen corresponding path program 1 times [2018-09-19 03:30:15,217 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:30:15,217 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 261 with the following transitions: [2018-09-19 03:30:15,218 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:30:15,221 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:30:15,222 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:30:17,620 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:30:28,352 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:30:28,352 INFO L272 AbstractInterpreter]: Visited 124 different actions 603 times. Merged at 7 different actions 27 times. Never widened. Found 5 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:30:28,360 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:30:29,816 INFO L232 lantSequenceWeakener]: Weakened 258 states. On average, predicates are now at 73.71% of their original sizes. [2018-09-19 03:30:29,817 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:30:30,100 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:30:30,100 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:30:30,100 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 03:30:30,101 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:30:30,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 03:30:30,101 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 03:30:30,101 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 03:30:30,102 INFO L87 Difference]: Start difference. First operand 3305 states and 4062 transitions. Second operand 10 states. [2018-09-19 03:30:38,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:30:38,235 INFO L93 Difference]: Finished difference Result 6634 states and 8307 transitions. [2018-09-19 03:30:38,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 03:30:38,237 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 260 [2018-09-19 03:30:38,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:30:38,251 INFO L225 Difference]: With dead ends: 6634 [2018-09-19 03:30:38,251 INFO L226 Difference]: Without dead ends: 3483 [2018-09-19 03:30:38,259 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 267 GetRequests, 251 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 03:30:38,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3483 states. [2018-09-19 03:30:38,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3483 to 3457. [2018-09-19 03:30:38,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3457 states. [2018-09-19 03:30:38,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3457 states to 3457 states and 4260 transitions. [2018-09-19 03:30:38,373 INFO L78 Accepts]: Start accepts. Automaton has 3457 states and 4260 transitions. Word has length 260 [2018-09-19 03:30:38,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:30:38,374 INFO L480 AbstractCegarLoop]: Abstraction has 3457 states and 4260 transitions. [2018-09-19 03:30:38,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 03:30:38,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3457 states and 4260 transitions. [2018-09-19 03:30:38,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-09-19 03:30:38,380 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:30:38,381 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:30:38,381 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:30:38,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1617296611, now seen corresponding path program 1 times [2018-09-19 03:30:38,382 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:30:38,382 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 262 with the following transitions: [2018-09-19 03:30:38,382 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:30:38,385 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:30:38,385 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:30:42,453 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:30:54,771 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:30:54,771 INFO L272 AbstractInterpreter]: Visited 118 different actions 687 times. Merged at 7 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:30:54,778 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:30:56,476 INFO L232 lantSequenceWeakener]: Weakened 259 states. On average, predicates are now at 73.71% of their original sizes. [2018-09-19 03:30:56,476 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:30:57,283 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:30:57,284 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:30:57,284 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:30:57,284 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:30:57,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:30:57,285 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:30:57,285 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:30:57,285 INFO L87 Difference]: Start difference. First operand 3457 states and 4260 transitions. Second operand 13 states. [2018-09-19 03:31:04,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:31:04,993 INFO L93 Difference]: Finished difference Result 8601 states and 11011 transitions. [2018-09-19 03:31:04,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:31:04,994 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 261 [2018-09-19 03:31:04,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:31:05,017 INFO L225 Difference]: With dead ends: 8601 [2018-09-19 03:31:05,017 INFO L226 Difference]: Without dead ends: 5298 [2018-09-19 03:31:05,027 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 273 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-19 03:31:05,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5298 states. [2018-09-19 03:31:05,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5298 to 4845. [2018-09-19 03:31:05,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4845 states. [2018-09-19 03:31:05,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4845 states to 4845 states and 6065 transitions. [2018-09-19 03:31:05,188 INFO L78 Accepts]: Start accepts. Automaton has 4845 states and 6065 transitions. Word has length 261 [2018-09-19 03:31:05,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:31:05,189 INFO L480 AbstractCegarLoop]: Abstraction has 4845 states and 6065 transitions. [2018-09-19 03:31:05,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:31:05,190 INFO L276 IsEmpty]: Start isEmpty. Operand 4845 states and 6065 transitions. [2018-09-19 03:31:05,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-09-19 03:31:05,198 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:31:05,199 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 03:31:05,199 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:31:05,199 INFO L82 PathProgramCache]: Analyzing trace with hash 197414643, now seen corresponding path program 1 times [2018-09-19 03:31:05,199 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:31:05,200 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 270 with the following transitions: [2018-09-19 03:31:05,200 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [542], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:31:05,203 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:31:05,204 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:31:07,932 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:31:22,297 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:31:22,297 INFO L272 AbstractInterpreter]: Visited 124 different actions 723 times. Merged at 7 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:31:22,306 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:31:23,725 INFO L232 lantSequenceWeakener]: Weakened 267 states. On average, predicates are now at 73.68% of their original sizes. [2018-09-19 03:31:23,725 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:31:24,084 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:31:24,084 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:31:24,085 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 03:31:24,085 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:31:24,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 03:31:24,086 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 03:31:24,086 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 03:31:24,086 INFO L87 Difference]: Start difference. First operand 4845 states and 6065 transitions. Second operand 11 states. [2018-09-19 03:31:30,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:31:30,789 INFO L93 Difference]: Finished difference Result 9755 states and 12399 transitions. [2018-09-19 03:31:30,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:31:30,790 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 269 [2018-09-19 03:31:30,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:31:30,808 INFO L225 Difference]: With dead ends: 9755 [2018-09-19 03:31:30,808 INFO L226 Difference]: Without dead ends: 5064 [2018-09-19 03:31:30,817 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 277 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-09-19 03:31:30,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5064 states. [2018-09-19 03:31:30,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5064 to 5004. [2018-09-19 03:31:30,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5004 states. [2018-09-19 03:31:30,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5004 states to 5004 states and 6279 transitions. [2018-09-19 03:31:30,975 INFO L78 Accepts]: Start accepts. Automaton has 5004 states and 6279 transitions. Word has length 269 [2018-09-19 03:31:30,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:31:30,976 INFO L480 AbstractCegarLoop]: Abstraction has 5004 states and 6279 transitions. [2018-09-19 03:31:30,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 03:31:30,976 INFO L276 IsEmpty]: Start isEmpty. Operand 5004 states and 6279 transitions. [2018-09-19 03:31:30,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-09-19 03:31:30,987 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:31:30,987 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:31:30,988 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:31:30,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1982326864, now seen corresponding path program 1 times [2018-09-19 03:31:30,988 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:31:30,989 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 291 with the following transitions: [2018-09-19 03:31:30,989 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [626], [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 03:31:30,992 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:31:30,992 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:31:33,847 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-09-19 03:31:40,633 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-19 03:31:40,634 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-19 03:31:40,635 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 03:31:40,679 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 03:31:40,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 03:31:40 BoogieIcfgContainer [2018-09-19 03:31:40,679 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 03:31:40,680 INFO L168 Benchmark]: Toolchain (without parser) took 251986.46 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -157.4 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-19 03:31:40,682 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 03:31:40,682 INFO L168 Benchmark]: CACSL2BoogieTranslator took 699.80 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 03:31:40,683 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.79 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 03:31:40,684 INFO L168 Benchmark]: Boogie Preprocessor took 274.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -833.9 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2018-09-19 03:31:40,685 INFO L168 Benchmark]: RCFGBuilder took 3544.63 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: 111.8 MB). Peak memory consumption was 111.8 MB. Max. memory is 7.1 GB. [2018-09-19 03:31:40,685 INFO L168 Benchmark]: TraceAbstraction took 247367.71 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 522.4 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-19 03:31:40,690 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 699.80 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 91.79 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 274.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -833.9 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3544.63 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: 111.8 MB). Peak memory consumption was 111.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 247367.71 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 522.4 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 196]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND 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 TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] RET return 25; [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 TRUE ((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)))))) [L361] a1 = ((((a1 - 46038) + -455425) * 10)/ 9) [L362] a19 = 10 [L364] RET return 24; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND TRUE (((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)) [L196] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 247.2s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 92.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2362 SDtfs, 11278 SDslu, 4066 SDs, 0 SdLazy, 24154 SolverSat, 2693 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 79.4s Time, PredicateUnifierStatistics: 24 DeclaredPredicates, 2594 GetRequests, 2364 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5004occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 130.8s AbstIntTime, 13 AbstIntIterations, 12 AbstIntStrong, 0.9949002519044494 AbsIntWeakeningRatio, 0.11147011308562198 AbsIntAvgWeakeningVarsNumRemoved, 896.0876413570275 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 1388 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label25_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_03-31-40-710.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label25_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_03-31-40-710.csv Completed graceful shutdown