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_OCT-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label23_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 19:20:53,986 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 19:20:53,988 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 19:20:54,001 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 19:20:54,002 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 19:20:54,003 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 19:20:54,004 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 19:20:54,006 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 19:20:54,008 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 19:20:54,009 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 19:20:54,013 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 19:20:54,013 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 19:20:54,014 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 19:20:54,019 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 19:20:54,020 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 19:20:54,025 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 19:20:54,026 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 19:20:54,029 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 19:20:54,030 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 19:20:54,033 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 19:20:54,034 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 19:20:54,035 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 19:20:54,037 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 19:20:54,037 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 19:20:54,038 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 19:20:54,038 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 19:20:54,039 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 19:20:54,040 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 19:20:54,041 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 19:20:54,042 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 19:20:54,042 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 19:20:54,043 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 19:20:54,043 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 19:20:54,043 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 19:20:54,044 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 19:20:54,045 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 19:20:54,045 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf [2018-09-15 19:20:54,060 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 19:20:54,060 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 19:20:54,061 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 19:20:54,062 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 19:20:54,062 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 19:20:54,062 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 19:20:54,062 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-15 19:20:54,063 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 19:20:54,063 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2018-09-15 19:20:54,063 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 19:20:54,063 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 19:20:54,063 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-15 19:20:54,064 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 19:20:54,064 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 19:20:54,064 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 19:20:54,065 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 19:20:54,065 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 19:20:54,065 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 19:20:54,065 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 19:20:54,065 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 19:20:54,066 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 19:20:54,066 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 19:20:54,066 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 19:20:54,066 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 19:20:54,066 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 19:20:54,067 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 19:20:54,067 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 19:20:54,067 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 19:20:54,067 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 19:20:54,067 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 19:20:54,068 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 19:20:54,068 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 19:20:54,068 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 19:20:54,068 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 19:20:54,113 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 19:20:54,127 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 19:20:54,131 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 19:20:54,133 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 19:20:54,134 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 19:20:54,134 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label23_true-unreach-call.c [2018-09-15 19:20:54,544 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5498bd08b/46b23aa2b4934f7a8fdacbe75c730820/FLAG6742e6301 [2018-09-15 19:20:54,829 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 19:20:54,830 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label23_true-unreach-call.c [2018-09-15 19:20:54,847 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5498bd08b/46b23aa2b4934f7a8fdacbe75c730820/FLAG6742e6301 [2018-09-15 19:20:54,880 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5498bd08b/46b23aa2b4934f7a8fdacbe75c730820 [2018-09-15 19:20:54,893 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 19:20:54,900 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 19:20:54,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 19:20:54,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 19:20:54,913 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 19:20:54,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:20:54" (1/1) ... [2018-09-15 19:20:54,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c40084a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:20:54, skipping insertion in model container [2018-09-15 19:20:54,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:20:54" (1/1) ... [2018-09-15 19:20:54,933 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 19:20:55,485 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 19:20:55,508 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 19:20:55,624 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 19:20:55,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:20:55 WrapperNode [2018-09-15 19:20:55,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 19:20:55,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 19:20:55,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 19:20:55,698 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 19:20:55,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:20:55" (1/1) ... [2018-09-15 19:20:55,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:20:55" (1/1) ... [2018-09-15 19:20:55,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 19:20:55,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 19:20:55,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 19:20:55,845 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 19:20:56,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:20:55" (1/1) ... [2018-09-15 19:20:56,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:20:55" (1/1) ... [2018-09-15 19:20:56,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:20:55" (1/1) ... [2018-09-15 19:20:56,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:20:55" (1/1) ... [2018-09-15 19:20:56,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:20:55" (1/1) ... [2018-09-15 19:20:56,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:20:55" (1/1) ... [2018-09-15 19:20:56,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:20:55" (1/1) ... [2018-09-15 19:20:56,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 19:20:56,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 19:20:56,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 19:20:56,106 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 19:20:56,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:20:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 19:20:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 19:20:56,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 19:20:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 19:20:56,183 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 19:20:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 19:20:56,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 19:20:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 19:20:56,184 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 19:20:59,601 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 19:20:59,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:20:59 BoogieIcfgContainer [2018-09-15 19:20:59,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 19:20:59,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 19:20:59,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 19:20:59,607 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 19:20:59,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 07:20:54" (1/3) ... [2018-09-15 19:20:59,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430dba69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:20:59, skipping insertion in model container [2018-09-15 19:20:59,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:20:55" (2/3) ... [2018-09-15 19:20:59,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430dba69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:20:59, skipping insertion in model container [2018-09-15 19:20:59,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:20:59" (3/3) ... [2018-09-15 19:20:59,612 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label23_true-unreach-call.c [2018-09-15 19:20:59,623 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 19:20:59,632 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 19:20:59,689 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 19:20:59,689 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 19:20:59,690 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 19:20:59,690 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 19:20:59,690 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 19:20:59,690 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 19:20:59,690 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 19:20:59,690 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 19:20:59,691 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 19:20:59,717 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-15 19:20:59,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-15 19:20:59,727 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:20:59,728 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] [2018-09-15 19:20:59,730 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:20:59,735 INFO L82 PathProgramCache]: Analyzing trace with hash 508483465, now seen corresponding path program 1 times [2018-09-15 19:20:59,738 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:20:59,739 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-09-15 19:20:59,742 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], [325], [327], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-15 19:20:59,824 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:20:59,825 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:21:01,121 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:21:01,123 INFO L272 AbstractInterpreter]: Visited 52 different actions 52 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-15 19:21:01,141 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:21:01,708 INFO L232 lantSequenceWeakener]: Weakened 51 states. On average, predicates are now at 75.73% of their original sizes. [2018-09-15 19:21:01,708 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:21:01,989 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:21:01,994 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:21:01,995 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-15 19:21:01,995 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:21:02,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-15 19:21:02,014 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-15 19:21:02,015 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 19:21:02,018 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-15 19:21:06,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:21:06,295 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-15 19:21:06,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-15 19:21:06,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-09-15 19:21:06,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:21:06,317 INFO L225 Difference]: With dead ends: 576 [2018-09-15 19:21:06,317 INFO L226 Difference]: Without dead ends: 358 [2018-09-15 19:21:06,323 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 48 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-15 19:21:06,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-15 19:21:06,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-15 19:21:06,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-15 19:21:06,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-15 19:21:06,420 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 53 [2018-09-15 19:21:06,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:21:06,422 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-15 19:21:06,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-15 19:21:06,423 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-15 19:21:06,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-15 19:21:06,433 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:21:06,434 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 19:21:06,434 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:21:06,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1413814341, now seen corresponding path program 1 times [2018-09-15 19:21:06,435 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:21:06,435 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 125 with the following transitions: [2018-09-15 19:21:06,437 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], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:21:06,453 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:21:06,453 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:21:07,786 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:21:10,385 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:21:10,385 INFO L272 AbstractInterpreter]: Visited 78 different actions 150 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 19:21:10,391 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:21:12,421 INFO L232 lantSequenceWeakener]: Weakened 122 states. On average, predicates are now at 74.1% of their original sizes. [2018-09-15 19:21:12,421 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:21:13,329 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:21:13,329 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:21:13,329 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-15 19:21:13,330 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:21:13,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-15 19:21:13,331 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-15 19:21:13,331 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-15 19:21:13,332 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-15 19:21:21,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:21:21,195 INFO L93 Difference]: Finished difference Result 711 states and 1126 transitions. [2018-09-15 19:21:21,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-15 19:21:21,197 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2018-09-15 19:21:21,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:21:21,205 INFO L225 Difference]: With dead ends: 711 [2018-09-15 19:21:21,205 INFO L226 Difference]: Without dead ends: 505 [2018-09-15 19:21:21,207 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 130 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-15 19:21:21,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-09-15 19:21:21,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 502. [2018-09-15 19:21:21,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-09-15 19:21:21,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 655 transitions. [2018-09-15 19:21:21,245 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 655 transitions. Word has length 124 [2018-09-15 19:21:21,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:21:21,246 INFO L480 AbstractCegarLoop]: Abstraction has 502 states and 655 transitions. [2018-09-15 19:21:21,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-15 19:21:21,246 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 655 transitions. [2018-09-15 19:21:21,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-09-15 19:21:21,250 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:21:21,250 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 19:21:21,250 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:21:21,251 INFO L82 PathProgramCache]: Analyzing trace with hash 958601716, now seen corresponding path program 1 times [2018-09-15 19:21:21,251 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:21:21,251 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 134 with the following transitions: [2018-09-15 19:21:21,251 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], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:21:21,256 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:21:21,256 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:21:25,521 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:21:25,521 INFO L272 AbstractInterpreter]: Visited 87 different actions 167 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 19:21:25,532 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:21:26,399 INFO L232 lantSequenceWeakener]: Weakened 131 states. On average, predicates are now at 74% of their original sizes. [2018-09-15 19:21:26,400 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:21:27,074 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:21:27,074 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:21:27,075 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-15 19:21:27,075 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:21:27,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-15 19:21:27,076 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-15 19:21:27,076 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-09-15 19:21:27,076 INFO L87 Difference]: Start difference. First operand 502 states and 655 transitions. Second operand 12 states. [2018-09-15 19:21:38,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:21:38,237 INFO L93 Difference]: Finished difference Result 1002 states and 1569 transitions. [2018-09-15 19:21:38,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-15 19:21:38,245 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 133 [2018-09-15 19:21:38,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:21:38,254 INFO L225 Difference]: With dead ends: 1002 [2018-09-15 19:21:38,255 INFO L226 Difference]: Without dead ends: 796 [2018-09-15 19:21:38,257 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 140 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-09-15 19:21:38,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-09-15 19:21:38,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 793. [2018-09-15 19:21:38,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2018-09-15 19:21:38,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 962 transitions. [2018-09-15 19:21:38,312 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 962 transitions. Word has length 133 [2018-09-15 19:21:38,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:21:38,313 INFO L480 AbstractCegarLoop]: Abstraction has 793 states and 962 transitions. [2018-09-15 19:21:38,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-15 19:21:38,314 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 962 transitions. [2018-09-15 19:21:38,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-09-15 19:21:38,319 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:21:38,320 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 19:21:38,320 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:21:38,320 INFO L82 PathProgramCache]: Analyzing trace with hash 404358396, now seen corresponding path program 1 times [2018-09-15 19:21:38,320 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:21:38,321 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 170 with the following transitions: [2018-09-15 19:21:38,321 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], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:21:38,327 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:21:38,327 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:21:42,835 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:21:51,784 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:21:51,784 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-15 19:21:51,793 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:21:53,944 INFO L232 lantSequenceWeakener]: Weakened 167 states. On average, predicates are now at 73.73% of their original sizes. [2018-09-15 19:21:53,945 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:21:54,951 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:21:54,951 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:21:54,951 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-15 19:21:54,952 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:21:54,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-15 19:21:54,953 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-15 19:21:54,953 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-15 19:21:54,953 INFO L87 Difference]: Start difference. First operand 793 states and 962 transitions. Second operand 14 states. [2018-09-15 19:22:05,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:22:05,263 INFO L93 Difference]: Finished difference Result 1161 states and 1610 transitions. [2018-09-15 19:22:05,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-15 19:22:05,264 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 169 [2018-09-15 19:22:05,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:22:05,271 INFO L225 Difference]: With dead ends: 1161 [2018-09-15 19:22:05,271 INFO L226 Difference]: Without dead ends: 955 [2018-09-15 19:22:05,273 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 180 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2018-09-15 19:22:05,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-09-15 19:22:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 943. [2018-09-15 19:22:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-09-15 19:22:05,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1137 transitions. [2018-09-15 19:22:05,318 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1137 transitions. Word has length 169 [2018-09-15 19:22:05,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:22:05,318 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 1137 transitions. [2018-09-15 19:22:05,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-15 19:22:05,319 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1137 transitions. [2018-09-15 19:22:05,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-15 19:22:05,322 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:22:05,322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 19:22:05,323 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:22:05,323 INFO L82 PathProgramCache]: Analyzing trace with hash 898100283, now seen corresponding path program 1 times [2018-09-15 19:22:05,323 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:22:05,324 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 189 with the following transitions: [2018-09-15 19:22:05,324 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], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:22:05,329 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:22:05,329 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:22:17,728 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:22:17,728 INFO L272 AbstractInterpreter]: Visited 142 different actions 278 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 19:22:17,734 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:22:19,388 INFO L232 lantSequenceWeakener]: Weakened 186 states. On average, predicates are now at 73.62% of their original sizes. [2018-09-15 19:22:19,388 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:22:20,885 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:22:20,885 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:22:20,885 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-09-15 19:22:20,886 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:22:20,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-15 19:22:20,886 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-15 19:22:20,887 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-09-15 19:22:20,887 INFO L87 Difference]: Start difference. First operand 943 states and 1137 transitions. Second operand 18 states. [2018-09-15 19:22:30,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:22:30,287 INFO L93 Difference]: Finished difference Result 1561 states and 2167 transitions. [2018-09-15 19:22:30,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-15 19:22:30,292 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 188 [2018-09-15 19:22:30,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:22:30,299 INFO L225 Difference]: With dead ends: 1561 [2018-09-15 19:22:30,299 INFO L226 Difference]: Without dead ends: 1207 [2018-09-15 19:22:30,302 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 204 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=287, Invalid=903, Unknown=0, NotChecked=0, Total=1190 [2018-09-15 19:22:30,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-09-15 19:22:30,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1205. [2018-09-15 19:22:30,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-09-15 19:22:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1418 transitions. [2018-09-15 19:22:30,355 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1418 transitions. Word has length 188 [2018-09-15 19:22:30,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:22:30,356 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1418 transitions. [2018-09-15 19:22:30,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-15 19:22:30,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1418 transitions. [2018-09-15 19:22:30,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-15 19:22:30,360 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:22:30,360 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 19:22:30,360 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:22:30,360 INFO L82 PathProgramCache]: Analyzing trace with hash -924485026, now seen corresponding path program 1 times [2018-09-15 19:22:30,361 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:22:30,361 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 201 with the following transitions: [2018-09-15 19:22:30,361 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], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:22:30,366 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:22:30,372 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:22:31,590 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:22:37,593 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:22:37,593 INFO L272 AbstractInterpreter]: Visited 84 different actions 244 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 19:22:37,601 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:22:39,232 INFO L232 lantSequenceWeakener]: Weakened 198 states. On average, predicates are now at 73.63% of their original sizes. [2018-09-15 19:22:39,232 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:22:39,779 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:22:39,779 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:22:39,779 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 19:22:39,780 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:22:39,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 19:22:39,780 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 19:22:39,781 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-15 19:22:39,781 INFO L87 Difference]: Start difference. First operand 1205 states and 1418 transitions. Second operand 11 states. [2018-09-15 19:22:50,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:22:50,018 INFO L93 Difference]: Finished difference Result 1717 states and 2233 transitions. [2018-09-15 19:22:50,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-15 19:22:50,018 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 200 [2018-09-15 19:22:50,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:22:50,026 INFO L225 Difference]: With dead ends: 1717 [2018-09-15 19:22:50,026 INFO L226 Difference]: Without dead ends: 1363 [2018-09-15 19:22:50,028 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 209 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-09-15 19:22:50,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2018-09-15 19:22:50,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1353. [2018-09-15 19:22:50,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1353 states. [2018-09-15 19:22:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1584 transitions. [2018-09-15 19:22:50,088 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1584 transitions. Word has length 200 [2018-09-15 19:22:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:22:50,089 INFO L480 AbstractCegarLoop]: Abstraction has 1353 states and 1584 transitions. [2018-09-15 19:22:50,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 19:22:50,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1584 transitions. [2018-09-15 19:22:50,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-15 19:22:50,093 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:22:50,093 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, 2, 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] [2018-09-15 19:22:50,094 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:22:50,094 INFO L82 PathProgramCache]: Analyzing trace with hash 2074211878, now seen corresponding path program 1 times [2018-09-15 19:22:50,094 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:22:50,094 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2018-09-15 19:22:50,095 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], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:22:50,098 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:22:50,098 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:22:51,517 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:23:08,285 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:23:08,285 INFO L272 AbstractInterpreter]: Visited 88 different actions 511 times. Merged at 7 different actions 38 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 19:23:08,292 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:23:10,058 INFO L232 lantSequenceWeakener]: Weakened 202 states. On average, predicates are now at 73.61% of their original sizes. [2018-09-15 19:23:10,058 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:23:10,966 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:23:10,967 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:23:10,967 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-09-15 19:23:10,967 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:23:10,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-15 19:23:10,968 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-15 19:23:10,968 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-09-15 19:23:10,968 INFO L87 Difference]: Start difference. First operand 1353 states and 1584 transitions. Second operand 15 states. [2018-09-15 19:23:25,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:23:25,952 INFO L93 Difference]: Finished difference Result 2559 states and 3382 transitions. [2018-09-15 19:23:25,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-15 19:23:25,956 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 204 [2018-09-15 19:23:25,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:23:25,972 INFO L225 Difference]: With dead ends: 2559 [2018-09-15 19:23:25,972 INFO L226 Difference]: Without dead ends: 2057 [2018-09-15 19:23:25,975 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 215 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2018-09-15 19:23:25,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2018-09-15 19:23:26,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 2037. [2018-09-15 19:23:26,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2037 states. [2018-09-15 19:23:26,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 2424 transitions. [2018-09-15 19:23:26,078 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 2424 transitions. Word has length 204 [2018-09-15 19:23:26,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:23:26,079 INFO L480 AbstractCegarLoop]: Abstraction has 2037 states and 2424 transitions. [2018-09-15 19:23:26,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-15 19:23:26,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 2424 transitions. [2018-09-15 19:23:26,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-09-15 19:23:26,086 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:23:26,086 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, 2, 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] [2018-09-15 19:23:26,086 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:23:26,087 INFO L82 PathProgramCache]: Analyzing trace with hash 421357757, now seen corresponding path program 1 times [2018-09-15 19:23:26,087 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:23:26,087 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 238 with the following transitions: [2018-09-15 19:23:26,087 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], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:23:26,090 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:23:26,090 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:23:27,554 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:23:46,471 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:23:46,472 INFO L272 AbstractInterpreter]: Visited 121 different actions 356 times. Merged at 7 different actions 15 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 19:23:46,478 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:23:49,237 INFO L232 lantSequenceWeakener]: Weakened 235 states. On average, predicates are now at 73.49% of their original sizes. [2018-09-15 19:23:49,237 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:23:50,845 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:23:50,846 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:23:50,846 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-09-15 19:23:50,846 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:23:50,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-15 19:23:50,846 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-15 19:23:50,847 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2018-09-15 19:23:50,847 INFO L87 Difference]: Start difference. First operand 2037 states and 2424 transitions. Second operand 19 states. [2018-09-15 19:24:09,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:24:09,340 INFO L93 Difference]: Finished difference Result 4438 states and 5613 transitions. [2018-09-15 19:24:09,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-15 19:24:09,343 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 237 [2018-09-15 19:24:09,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:24:09,358 INFO L225 Difference]: With dead ends: 4438 [2018-09-15 19:24:09,358 INFO L226 Difference]: Without dead ends: 2961 [2018-09-15 19:24:09,364 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 255 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=341, Invalid=1065, Unknown=0, NotChecked=0, Total=1406 [2018-09-15 19:24:09,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2018-09-15 19:24:09,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 2897. [2018-09-15 19:24:09,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2897 states. [2018-09-15 19:24:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2897 states to 2897 states and 3445 transitions. [2018-09-15 19:24:09,506 INFO L78 Accepts]: Start accepts. Automaton has 2897 states and 3445 transitions. Word has length 237 [2018-09-15 19:24:09,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:24:09,507 INFO L480 AbstractCegarLoop]: Abstraction has 2897 states and 3445 transitions. [2018-09-15 19:24:09,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-15 19:24:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 3445 transitions. [2018-09-15 19:24:09,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-09-15 19:24:09,513 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:24:09,514 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 19:24:09,514 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:24:09,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1001402420, now seen corresponding path program 1 times [2018-09-15 19:24:09,515 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:24:09,515 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 243 with the following transitions: [2018-09-15 19:24:09,515 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], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:24:09,518 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:24:09,518 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:24:13,790 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:24:42,461 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:24:42,461 INFO L272 AbstractInterpreter]: Visited 124 different actions 604 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 19:24:42,468 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:24:45,319 INFO L232 lantSequenceWeakener]: Weakened 240 states. On average, predicates are now at 73.47% of their original sizes. [2018-09-15 19:24:45,320 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:24:48,831 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:24:48,831 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:24:48,831 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-15 19:24:48,831 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:24:48,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-15 19:24:48,832 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-15 19:24:48,832 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-09-15 19:24:48,832 INFO L87 Difference]: Start difference. First operand 2897 states and 3445 transitions. Second operand 17 states. [2018-09-15 19:24:59,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:24:59,599 INFO L93 Difference]: Finished difference Result 5136 states and 6327 transitions. [2018-09-15 19:24:59,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-15 19:24:59,603 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 242 [2018-09-15 19:24:59,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:24:59,615 INFO L225 Difference]: With dead ends: 5136 [2018-09-15 19:24:59,615 INFO L226 Difference]: Without dead ends: 3090 [2018-09-15 19:24:59,622 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 255 GetRequests, 215 SyntacticMatches, 11 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=236, Invalid=694, Unknown=0, NotChecked=0, Total=930 [2018-09-15 19:24:59,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3090 states. [2018-09-15 19:24:59,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3090 to 3049. [2018-09-15 19:24:59,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3049 states. [2018-09-15 19:24:59,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3049 states to 3049 states and 3644 transitions. [2018-09-15 19:24:59,760 INFO L78 Accepts]: Start accepts. Automaton has 3049 states and 3644 transitions. Word has length 242 [2018-09-15 19:24:59,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:24:59,761 INFO L480 AbstractCegarLoop]: Abstraction has 3049 states and 3644 transitions. [2018-09-15 19:24:59,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-15 19:24:59,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3049 states and 3644 transitions. [2018-09-15 19:24:59,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-09-15 19:24:59,768 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:24:59,769 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 19:24:59,769 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:24:59,769 INFO L82 PathProgramCache]: Analyzing trace with hash -2098390077, now seen corresponding path program 1 times [2018-09-15 19:24:59,769 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:24:59,770 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 248 with the following transitions: [2018-09-15 19:24:59,770 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], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [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-15 19:24:59,773 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:24:59,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:25:03,721 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-09-15 19:25:18,684 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-15 19:25:18,685 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-15 19:25:18,687 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 19:25:18,724 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 19:25:18,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 07:25:18 BoogieIcfgContainer [2018-09-15 19:25:18,725 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 19:25:18,726 INFO L168 Benchmark]: Toolchain (without parser) took 263831.25 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 2.3 GB in the end (delta: -918.3 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-15 19:25:18,728 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-15 19:25:18,728 INFO L168 Benchmark]: CACSL2BoogieTranslator took 795.33 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-15 19:25:18,730 INFO L168 Benchmark]: Boogie Procedure Inliner took 147.04 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-15 19:25:18,730 INFO L168 Benchmark]: Boogie Preprocessor took 260.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 771.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -852.2 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. [2018-09-15 19:25:18,731 INFO L168 Benchmark]: RCFGBuilder took 3496.68 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: 108.8 MB). Peak memory consumption was 108.8 MB. Max. memory is 7.1 GB. [2018-09-15 19:25:18,732 INFO L168 Benchmark]: TraceAbstraction took 259121.29 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 2.3 GB in the end (delta: -217.2 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-15 19:25:18,737 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 795.33 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 147.04 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 260.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 771.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -852.2 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3496.68 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: 108.8 MB). Peak memory consumption was 108.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 259121.29 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 2.3 GB in the end (delta: -217.2 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 142]: 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 TRUE (((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0)) [L245] a1 = (((((a1 % 25)- -13) - 42605) / 5) - -8517) [L246] a10 = 3 [L248] RET return 26; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL 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 TRUE (((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)) [L142] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 259.0s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 97.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1800 SDtfs, 8180 SDslu, 3518 SDs, 0 SdLazy, 19456 SolverSat, 1852 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 84.2s Time, PredicateUnifierStatistics: 18 DeclaredPredicates, 1640 GetRequests, 1426 SyntacticMatches, 11 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 17.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3049occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 133.2s AbstIntTime, 10 AbstIntIterations, 9 AbstIntStrong, 0.9941019254988156 AbsIntWeakeningRatio, 0.12848799480856588 AbsIntAvgWeakeningVarsNumRemoved, 84.02660609993511 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 157 StatesRemovedByMinimization, 9 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_label23_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_19-25-18-754.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label23_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_19-25-18-754.csv Completed graceful shutdown