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_CON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label35_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-11 18:58:21,577 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-11 18:58:21,579 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-11 18:58:21,598 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-11 18:58:21,598 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-11 18:58:21,599 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-11 18:58:21,600 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-11 18:58:21,604 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-11 18:58:21,606 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-11 18:58:21,608 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-11 18:58:21,609 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-11 18:58:21,609 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-11 18:58:21,611 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-11 18:58:21,613 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-11 18:58:21,614 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-11 18:58:21,614 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-11 18:58:21,615 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-11 18:58:21,617 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-11 18:58:21,619 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-11 18:58:21,621 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-11 18:58:21,622 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-11 18:58:21,623 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-11 18:58:21,626 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-11 18:58:21,626 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-11 18:58:21,626 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-11 18:58:21,627 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-11 18:58:21,628 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-11 18:58:21,629 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-11 18:58:21,630 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-11 18:58:21,631 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-11 18:58:21,631 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-11 18:58:21,632 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-11 18:58:21,632 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-11 18:58:21,632 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-11 18:58:21,633 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-11 18:58:21,634 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-11 18:58:21,634 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf [2018-09-11 18:58:21,651 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-11 18:58:21,651 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-11 18:58:21,653 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-11 18:58:21,653 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-11 18:58:21,653 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-11 18:58:21,654 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-11 18:58:21,654 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-11 18:58:21,654 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-11 18:58:21,654 INFO L133 SettingsManager]: * Abstract domain=CongruenceDomain [2018-09-11 18:58:21,654 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-11 18:58:21,655 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-11 18:58:21,655 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-11 18:58:21,655 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-11 18:58:21,656 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-11 18:58:21,656 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-11 18:58:21,656 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-11 18:58:21,656 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-11 18:58:21,656 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-11 18:58:21,657 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-11 18:58:21,657 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-11 18:58:21,657 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-11 18:58:21,657 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-11 18:58:21,657 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-11 18:58:21,658 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-11 18:58:21,658 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-11 18:58:21,658 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-11 18:58:21,658 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-11 18:58:21,658 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-11 18:58:21,659 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-11 18:58:21,659 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-11 18:58:21,659 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-11 18:58:21,659 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-11 18:58:21,659 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-11 18:58:21,660 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-11 18:58:21,703 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-11 18:58:21,719 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-11 18:58:21,723 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-11 18:58:21,725 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-11 18:58:21,726 INFO L276 PluginConnector]: CDTParser initialized [2018-09-11 18:58:21,727 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label35_true-unreach-call.c [2018-09-11 18:58:22,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/322f056b1/0504dd6d5d484d43957bfaf777c93aa8/FLAG262b79ae4 [2018-09-11 18:58:22,329 INFO L276 CDTParser]: Found 1 translation units. [2018-09-11 18:58:22,329 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label35_true-unreach-call.c [2018-09-11 18:58:22,344 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/322f056b1/0504dd6d5d484d43957bfaf777c93aa8/FLAG262b79ae4 [2018-09-11 18:58:22,361 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/322f056b1/0504dd6d5d484d43957bfaf777c93aa8 [2018-09-11 18:58:22,373 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-11 18:58:22,376 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-11 18:58:22,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-11 18:58:22,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-11 18:58:22,387 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-11 18:58:22,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 06:58:22" (1/1) ... [2018-09-11 18:58:22,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d63d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:58:22, skipping insertion in model container [2018-09-11 18:58:22,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 06:58:22" (1/1) ... [2018-09-11 18:58:22,638 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-11 18:58:22,897 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-11 18:58:22,919 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-11 18:58:23,088 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-11 18:58:23,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:58:23 WrapperNode [2018-09-11 18:58:23,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-11 18:58:23,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-11 18:58:23,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-11 18:58:23,147 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-11 18:58:23,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:58:23" (1/1) ... [2018-09-11 18:58:23,184 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:58:23" (1/1) ... [2018-09-11 18:58:23,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-11 18:58:23,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-11 18:58:23,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-11 18:58:23,272 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-11 18:58:23,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:58:23" (1/1) ... [2018-09-11 18:58:23,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:58:23" (1/1) ... [2018-09-11 18:58:23,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:58:23" (1/1) ... [2018-09-11 18:58:23,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:58:23" (1/1) ... [2018-09-11 18:58:23,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:58:23" (1/1) ... [2018-09-11 18:58:23,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:58:23" (1/1) ... [2018-09-11 18:58:23,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:58:23" (1/1) ... [2018-09-11 18:58:23,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-11 18:58:23,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-11 18:58:23,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-11 18:58:23,546 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-11 18:58:23,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:58:23" (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-11 18:58:23,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-11 18:58:23,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-11 18:58:23,621 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-11 18:58:23,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-11 18:58:23,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-11 18:58:23,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-11 18:58:23,621 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-11 18:58:23,622 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-11 18:58:27,170 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-11 18:58:27,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 06:58:27 BoogieIcfgContainer [2018-09-11 18:58:27,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-11 18:58:27,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-11 18:58:27,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-11 18:58:27,176 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-11 18:58:27,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 06:58:22" (1/3) ... [2018-09-11 18:58:27,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4594dab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 06:58:27, skipping insertion in model container [2018-09-11 18:58:27,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:58:23" (2/3) ... [2018-09-11 18:58:27,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4594dab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 06:58:27, skipping insertion in model container [2018-09-11 18:58:27,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 06:58:27" (3/3) ... [2018-09-11 18:58:27,183 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label35_true-unreach-call.c [2018-09-11 18:58:27,195 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-11 18:58:27,205 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-11 18:58:27,261 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-11 18:58:27,262 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-11 18:58:27,262 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-11 18:58:27,262 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-11 18:58:27,262 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-11 18:58:27,262 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-11 18:58:27,262 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-11 18:58:27,263 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-11 18:58:27,263 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-11 18:58:27,292 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-11 18:58:27,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-11 18:58:27,303 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 18:58:27,304 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-11 18:58:27,306 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 18:58:27,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1718908404, now seen corresponding path program 1 times [2018-09-11 18:58:27,314 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 18:58:27,316 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-09-11 18:58:27,319 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [365], [367], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-11 18:58:27,355 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 18:58:27,355 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 18:58:27,583 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 18:58:27,585 INFO L272 AbstractInterpreter]: Visited 57 different actions 57 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-11 18:58:27,606 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 18:58:27,736 INFO L232 lantSequenceWeakener]: Weakened 55 states. On average, predicates are now at 75.5% of their original sizes. [2018-09-11 18:58:27,737 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 18:58:27,816 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 18:58:27,818 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 18:58:27,820 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-11 18:58:27,820 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 18:58:27,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-11 18:58:27,836 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-11 18:58:27,837 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-11 18:58:27,840 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 5 states. [2018-09-11 18:58:30,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 18:58:30,062 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-11 18:58:30,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-11 18:58:30,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-09-11 18:58:30,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 18:58:30,084 INFO L225 Difference]: With dead ends: 576 [2018-09-11 18:58:30,084 INFO L226 Difference]: Without dead ends: 358 [2018-09-11 18:58:30,091 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-11 18:58:30,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-11 18:58:30,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-11 18:58:30,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-11 18:58:30,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-11 18:58:30,167 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 58 [2018-09-11 18:58:30,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 18:58:30,168 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-11 18:58:30,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-11 18:58:30,168 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-11 18:58:30,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-09-11 18:58:30,177 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 18:58:30,177 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-11 18:58:30,177 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 18:58:30,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1432261539, now seen corresponding path program 1 times [2018-09-11 18:58:30,178 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 18:58:30,178 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2018-09-11 18:58:30,179 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [365], [367], [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-11 18:58:30,183 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 18:58:30,184 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 18:58:30,340 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 18:58:30,341 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-11 18:58:30,381 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 18:58:30,653 INFO L232 lantSequenceWeakener]: Weakened 126 states. On average, predicates are now at 74.07% of their original sizes. [2018-09-11 18:58:30,653 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 18:58:31,013 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 18:58:31,014 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 18:58:31,014 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 18:58:31,014 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 18:58:31,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 18:58:31,016 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 18:58:31,016 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 18:58:31,016 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 9 states. [2018-09-11 18:58:36,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 18:58:36,372 INFO L93 Difference]: Finished difference Result 719 states and 1134 transitions. [2018-09-11 18:58:36,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-11 18:58:36,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2018-09-11 18:58:36,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 18:58:36,383 INFO L225 Difference]: With dead ends: 719 [2018-09-11 18:58:36,383 INFO L226 Difference]: Without dead ends: 513 [2018-09-11 18:58:36,386 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 135 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-11 18:58:36,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-09-11 18:58:36,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 504. [2018-09-11 18:58:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-09-11 18:58:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 662 transitions. [2018-09-11 18:58:36,434 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 662 transitions. Word has length 129 [2018-09-11 18:58:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 18:58:36,435 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 662 transitions. [2018-09-11 18:58:36,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 18:58:36,435 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 662 transitions. [2018-09-11 18:58:36,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-11 18:58:36,442 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 18:58:36,442 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 18:58:36,443 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 18:58:36,443 INFO L82 PathProgramCache]: Analyzing trace with hash -352320280, now seen corresponding path program 1 times [2018-09-11 18:58:36,443 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 18:58:36,443 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 139 with the following transitions: [2018-09-11 18:58:36,444 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [365], [367], [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-11 18:58:36,447 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 18:58:36,447 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 18:58:36,549 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 18:58:36,550 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-11 18:58:36,589 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 18:58:36,762 INFO L232 lantSequenceWeakener]: Weakened 135 states. On average, predicates are now at 74.06% of their original sizes. [2018-09-11 18:58:36,763 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 18:58:37,165 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 18:58:37,166 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 18:58:37,166 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 18:58:37,166 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 18:58:37,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 18:58:37,167 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 18:58:37,167 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 18:58:37,168 INFO L87 Difference]: Start difference. First operand 504 states and 662 transitions. Second operand 9 states. [2018-09-11 18:58:41,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 18:58:41,532 INFO L93 Difference]: Finished difference Result 1139 states and 1712 transitions. [2018-09-11 18:58:41,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-11 18:58:41,532 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 138 [2018-09-11 18:58:41,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 18:58:41,539 INFO L225 Difference]: With dead ends: 1139 [2018-09-11 18:58:41,539 INFO L226 Difference]: Without dead ends: 785 [2018-09-11 18:58:41,541 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 144 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-11 18:58:41,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-09-11 18:58:41,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 778. [2018-09-11 18:58:41,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2018-09-11 18:58:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 957 transitions. [2018-09-11 18:58:41,574 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 957 transitions. Word has length 138 [2018-09-11 18:58:41,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 18:58:41,575 INFO L480 AbstractCegarLoop]: Abstraction has 778 states and 957 transitions. [2018-09-11 18:58:41,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 18:58:41,575 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 957 transitions. [2018-09-11 18:58:41,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-11 18:58:41,579 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 18:58:41,580 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 18:58:41,580 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 18:58:41,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1031908192, now seen corresponding path program 1 times [2018-09-11 18:58:41,581 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 18:58:41,581 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 175 with the following transitions: [2018-09-11 18:58:41,581 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [365], [367], [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-11 18:58:41,585 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 18:58:41,585 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 18:58:41,846 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 18:58:41,846 INFO L272 AbstractInterpreter]: Visited 123 different actions 240 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-11 18:58:41,885 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 18:58:42,189 INFO L232 lantSequenceWeakener]: Weakened 171 states. On average, predicates are now at 73.78% of their original sizes. [2018-09-11 18:58:42,189 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 18:58:42,793 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 18:58:42,794 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 18:58:42,794 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 18:58:42,794 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 18:58:42,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 18:58:42,795 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 18:58:42,795 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 18:58:42,796 INFO L87 Difference]: Start difference. First operand 778 states and 957 transitions. Second operand 9 states. [2018-09-11 18:58:46,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 18:58:46,990 INFO L93 Difference]: Finished difference Result 1563 states and 2059 transitions. [2018-09-11 18:58:46,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-11 18:58:46,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 174 [2018-09-11 18:58:46,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 18:58:46,999 INFO L225 Difference]: With dead ends: 1563 [2018-09-11 18:58:46,999 INFO L226 Difference]: Without dead ends: 935 [2018-09-11 18:58:47,001 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 180 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-11 18:58:47,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2018-09-11 18:58:47,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 928. [2018-09-11 18:58:47,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2018-09-11 18:58:47,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1133 transitions. [2018-09-11 18:58:47,036 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1133 transitions. Word has length 174 [2018-09-11 18:58:47,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 18:58:47,036 INFO L480 AbstractCegarLoop]: Abstraction has 928 states and 1133 transitions. [2018-09-11 18:58:47,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 18:58:47,037 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1133 transitions. [2018-09-11 18:58:47,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-09-11 18:58:47,041 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 18:58:47,043 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 18:58:47,043 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 18:58:47,043 INFO L82 PathProgramCache]: Analyzing trace with hash 955963171, now seen corresponding path program 1 times [2018-09-11 18:58:47,043 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 18:58:47,044 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2018-09-11 18:58:47,044 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [365], [367], [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-11 18:58:47,050 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 18:58:47,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 18:58:47,232 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 18:58:47,232 INFO L272 AbstractInterpreter]: Visited 142 different actions 414 times. Merged at 5 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-11 18:58:47,269 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 18:58:47,347 INFO L232 lantSequenceWeakener]: Weakened 190 states. On average, predicates are now at 73.6% of their original sizes. [2018-09-11 18:58:47,348 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 18:58:47,553 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 18:58:47,553 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 18:58:47,554 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 18:58:47,554 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 18:58:47,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 18:58:47,555 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 18:58:47,555 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 18:58:47,555 INFO L87 Difference]: Start difference. First operand 928 states and 1133 transitions. Second operand 9 states. [2018-09-11 18:58:50,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 18:58:50,373 INFO L93 Difference]: Finished difference Result 1942 states and 2573 transitions. [2018-09-11 18:58:50,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-11 18:58:50,374 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 193 [2018-09-11 18:58:50,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 18:58:50,381 INFO L225 Difference]: With dead ends: 1942 [2018-09-11 18:58:50,381 INFO L226 Difference]: Without dead ends: 1164 [2018-09-11 18:58:50,385 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 199 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-11 18:58:50,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2018-09-11 18:58:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1157. [2018-09-11 18:58:50,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2018-09-11 18:58:50,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1390 transitions. [2018-09-11 18:58:50,425 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1390 transitions. Word has length 193 [2018-09-11 18:58:50,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 18:58:50,426 INFO L480 AbstractCegarLoop]: Abstraction has 1157 states and 1390 transitions. [2018-09-11 18:58:50,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 18:58:50,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1390 transitions. [2018-09-11 18:58:50,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-11 18:58:50,431 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 18:58:50,432 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-11 18:58:50,432 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 18:58:50,432 INFO L82 PathProgramCache]: Analyzing trace with hash 730630644, now seen corresponding path program 1 times [2018-09-11 18:58:50,432 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 18:58:50,433 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-09-11 18:58:50,433 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [365], [367], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [562], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-11 18:58:50,435 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 18:58:50,436 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 18:58:50,590 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 18:58:50,590 INFO L272 AbstractInterpreter]: Visited 95 different actions 368 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-11 18:58:50,630 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 18:58:50,728 INFO L232 lantSequenceWeakener]: Weakened 213 states. On average, predicates are now at 75.9% of their original sizes. [2018-09-11 18:58:50,728 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 18:58:51,184 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 18:58:51,185 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 18:58:51,185 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 18:58:51,185 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 18:58:51,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 18:58:51,186 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 18:58:51,186 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 18:58:51,188 INFO L87 Difference]: Start difference. First operand 1157 states and 1390 transitions. Second operand 9 states. [2018-09-11 18:58:54,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 18:58:54,569 INFO L93 Difference]: Finished difference Result 2420 states and 3040 transitions. [2018-09-11 18:58:54,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-11 18:58:54,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 216 [2018-09-11 18:58:54,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 18:58:54,585 INFO L225 Difference]: With dead ends: 2420 [2018-09-11 18:58:54,585 INFO L226 Difference]: Without dead ends: 1413 [2018-09-11 18:58:54,588 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 222 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-11 18:58:54,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2018-09-11 18:58:54,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1392. [2018-09-11 18:58:54,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states. [2018-09-11 18:58:54,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1678 transitions. [2018-09-11 18:58:54,635 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1678 transitions. Word has length 216 [2018-09-11 18:58:54,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 18:58:54,642 INFO L480 AbstractCegarLoop]: Abstraction has 1392 states and 1678 transitions. [2018-09-11 18:58:54,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 18:58:54,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1678 transitions. [2018-09-11 18:58:54,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-09-11 18:58:54,647 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 18:58:54,647 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11 18:58:54,647 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 18:58:54,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1632333344, now seen corresponding path program 1 times [2018-09-11 18:58:54,648 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 18:58:54,648 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 243 with the following transitions: [2018-09-11 18:58:54,649 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [365], [367], [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-11 18:58:54,650 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 18:58:54,651 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 18:58:54,778 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-11 18:58:54,779 INFO L272 AbstractInterpreter]: Visited 122 different actions 473 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-11 18:58:54,817 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-11 18:58:54,858 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-11 18:58:54,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 06:58:54 BoogieIcfgContainer [2018-09-11 18:58:54,859 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-11 18:58:54,860 INFO L168 Benchmark]: Toolchain (without parser) took 32486.73 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -696.5 MB). Peak memory consumption was 406.0 MB. Max. memory is 7.1 GB. [2018-09-11 18:58:54,862 INFO L168 Benchmark]: CDTParser took 0.20 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-11 18:58:54,863 INFO L168 Benchmark]: CACSL2BoogieTranslator took 768.18 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-11 18:58:54,863 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.74 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-11 18:58:54,864 INFO L168 Benchmark]: Boogie Preprocessor took 274.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 773.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -862.2 MB). Peak memory consumption was 32.1 MB. Max. memory is 7.1 GB. [2018-09-11 18:58:54,865 INFO L168 Benchmark]: RCFGBuilder took 3626.43 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.5 MB). Peak memory consumption was 108.5 MB. Max. memory is 7.1 GB. [2018-09-11 18:58:54,866 INFO L168 Benchmark]: TraceAbstraction took 27686.35 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 329.3 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 14.9 MB). Peak memory consumption was 344.1 MB. Max. memory is 7.1 GB. [2018-09-11 18:58:54,871 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 768.18 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 124.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 274.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 773.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -862.2 MB). Peak memory consumption was 32.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3626.43 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.5 MB). Peak memory consumption was 108.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27686.35 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 329.3 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 14.9 MB). Peak memory consumption was 344.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 157]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND TRUE ((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))) [L211] a1 = (((a1 + -15535) - 211896) / 5) [L212] a10 = 2 [L214] RET return 22; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND 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 TRUE ((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2)))) [L409] a1 = ((((a1 % 299890)+ 300108) * 1) * 1) [L410] a10 = 0 [L411] a19 = 8 [L413] RET return -1; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND TRUE (((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)) [L157] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 27.6s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 22.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1221 SDtfs, 3439 SDslu, 1939 SDs, 0 SdLazy, 10397 SolverSat, 1135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.8s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 937 GetRequests, 864 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1392occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.5s AbstIntTime, 7 AbstIntIterations, 6 AbstIntStrong, 0.9968802008175487 AbsIntWeakeningRatio, 0.13303769401330376 AbsIntAvgWeakeningVarsNumRemoved, 7.995565410199556 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 53 StatesRemovedByMinimization, 6 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_label35_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-11_18-58-54-886.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label35_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-11_18-58-54-886.csv Received shutdown request...