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_label18_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-11 18:57:20,645 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-11 18:57:20,648 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-11 18:57:20,664 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-11 18:57:20,665 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-11 18:57:20,666 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-11 18:57:20,667 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-11 18:57:20,669 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-11 18:57:20,672 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-11 18:57:20,673 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-11 18:57:20,675 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-11 18:57:20,676 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-11 18:57:20,677 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-11 18:57:20,678 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-11 18:57:20,680 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-11 18:57:20,681 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-11 18:57:20,684 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-11 18:57:20,686 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-11 18:57:20,694 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-11 18:57:20,697 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-11 18:57:20,698 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-11 18:57:20,700 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-11 18:57:20,702 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-11 18:57:20,702 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-11 18:57:20,705 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-11 18:57:20,706 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-11 18:57:20,707 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-11 18:57:20,708 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-11 18:57:20,710 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-11 18:57:20,711 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-11 18:57:20,711 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-11 18:57:20,713 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-11 18:57:20,713 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-11 18:57:20,713 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-11 18:57:20,714 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-11 18:57:20,716 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-11 18:57:20,716 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:57:20,741 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-11 18:57:20,741 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-11 18:57:20,742 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-11 18:57:20,743 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-11 18:57:20,743 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-11 18:57:20,744 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-11 18:57:20,744 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-11 18:57:20,744 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-11 18:57:20,744 INFO L133 SettingsManager]: * Abstract domain=CongruenceDomain [2018-09-11 18:57:20,744 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-11 18:57:20,744 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-11 18:57:20,745 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-11 18:57:20,746 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-11 18:57:20,747 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-11 18:57:20,747 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-11 18:57:20,747 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-11 18:57:20,747 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-11 18:57:20,747 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-11 18:57:20,748 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-11 18:57:20,748 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-11 18:57:20,748 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-11 18:57:20,748 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-11 18:57:20,748 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-11 18:57:20,749 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-11 18:57:20,749 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-11 18:57:20,749 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-11 18:57:20,749 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-11 18:57:20,749 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-11 18:57:20,750 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-11 18:57:20,750 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-11 18:57:20,750 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-11 18:57:20,750 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-11 18:57:20,750 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-11 18:57:20,751 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-11 18:57:20,798 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-11 18:57:20,812 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-11 18:57:20,817 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-11 18:57:20,819 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-11 18:57:20,820 INFO L276 PluginConnector]: CDTParser initialized [2018-09-11 18:57:20,821 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label18_true-unreach-call.c [2018-09-11 18:57:21,172 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d75bc43bf/5ead1cdd01904b24bd87dd5f783bc940/FLAG6b292696b [2018-09-11 18:57:21,423 INFO L276 CDTParser]: Found 1 translation units. [2018-09-11 18:57:21,424 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label18_true-unreach-call.c [2018-09-11 18:57:21,452 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d75bc43bf/5ead1cdd01904b24bd87dd5f783bc940/FLAG6b292696b [2018-09-11 18:57:21,470 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d75bc43bf/5ead1cdd01904b24bd87dd5f783bc940 [2018-09-11 18:57:21,480 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-11 18:57:21,483 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-11 18:57:21,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-11 18:57:21,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-11 18:57:21,491 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-11 18:57:21,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 06:57:21" (1/1) ... [2018-09-11 18:57:21,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18aaf647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:57:21, skipping insertion in model container [2018-09-11 18:57:21,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 06:57:21" (1/1) ... [2018-09-11 18:57:21,749 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-11 18:57:22,045 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-11 18:57:22,065 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-11 18:57:22,196 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-11 18:57:22,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:57:22 WrapperNode [2018-09-11 18:57:22,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-11 18:57:22,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-11 18:57:22,261 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-11 18:57:22,261 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-11 18:57:22,270 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:57:22" (1/1) ... [2018-09-11 18:57:22,307 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:57:22" (1/1) ... [2018-09-11 18:57:22,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-11 18:57:22,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-11 18:57:22,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-11 18:57:22,401 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-11 18:57:22,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:57:22" (1/1) ... [2018-09-11 18:57:22,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:57:22" (1/1) ... [2018-09-11 18:57:22,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:57:22" (1/1) ... [2018-09-11 18:57:22,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:57:22" (1/1) ... [2018-09-11 18:57:22,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:57:22" (1/1) ... [2018-09-11 18:57:22,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:57:22" (1/1) ... [2018-09-11 18:57:22,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:57:22" (1/1) ... [2018-09-11 18:57:22,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-11 18:57:22,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-11 18:57:22,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-11 18:57:22,650 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-11 18:57:22,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:57:22" (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:57:22,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-11 18:57:22,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-11 18:57:22,718 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:57:22,718 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:57:22,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-11 18:57:22,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-11 18:57:22,719 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-11 18:57:22,719 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-11 18:57:26,364 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-11 18:57:26,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 06:57:26 BoogieIcfgContainer [2018-09-11 18:57:26,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-11 18:57:26,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-11 18:57:26,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-11 18:57:26,370 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-11 18:57:26,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 06:57:21" (1/3) ... [2018-09-11 18:57:26,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427d2f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 06:57:26, skipping insertion in model container [2018-09-11 18:57:26,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 06:57:22" (2/3) ... [2018-09-11 18:57:26,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427d2f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 06:57:26, skipping insertion in model container [2018-09-11 18:57:26,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 06:57:26" (3/3) ... [2018-09-11 18:57:26,374 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label18_true-unreach-call.c [2018-09-11 18:57:26,385 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-11 18:57:26,394 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-11 18:57:26,441 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-11 18:57:26,442 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-11 18:57:26,442 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-11 18:57:26,442 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-11 18:57:26,442 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-11 18:57:26,442 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-11 18:57:26,443 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-11 18:57:26,443 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-11 18:57:26,443 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-11 18:57:26,469 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-11 18:57:26,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-11 18:57:26,480 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 18:57:26,481 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-11 18:57:26,483 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:57:26,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1094917127, now seen corresponding path program 1 times [2018-09-11 18:57:26,491 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 18:57:26,493 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-09-11 18:57:26,498 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [421], [423], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-11 18:57:26,533 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 18:57:26,533 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 18:57:26,754 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 18:57:26,756 INFO L272 AbstractInterpreter]: Visited 64 different actions 64 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-11 18:57:26,767 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 18:57:26,941 INFO L232 lantSequenceWeakener]: Weakened 62 states. On average, predicates are now at 75.7% of their original sizes. [2018-09-11 18:57:26,942 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 18:57:27,065 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 18:57:27,066 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 18:57:27,067 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-11 18:57:27,067 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 18:57:27,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-11 18:57:27,080 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-11 18:57:27,081 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-11 18:57:27,084 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 5 states. [2018-09-11 18:57:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 18:57:29,816 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-11 18:57:29,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-11 18:57:29,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-09-11 18:57:29,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 18:57:29,837 INFO L225 Difference]: With dead ends: 576 [2018-09-11 18:57:29,837 INFO L226 Difference]: Without dead ends: 358 [2018-09-11 18:57:29,844 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-11 18:57:29,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-11 18:57:29,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-11 18:57:29,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-11 18:57:29,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-11 18:57:29,923 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 65 [2018-09-11 18:57:29,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 18:57:29,924 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-11 18:57:29,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-11 18:57:29,925 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-11 18:57:29,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-11 18:57:29,933 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 18:57:29,936 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:57:29,937 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:57:29,937 INFO L82 PathProgramCache]: Analyzing trace with hash 175335915, now seen corresponding path program 1 times [2018-09-11 18:57:29,937 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 18:57:29,938 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 137 with the following transitions: [2018-09-11 18:57:29,938 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [421], [423], [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:57:29,944 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 18:57:29,945 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 18:57:30,074 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 18:57:30,074 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:57:30,101 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 18:57:30,349 INFO L232 lantSequenceWeakener]: Weakened 133 states. On average, predicates are now at 74.24% of their original sizes. [2018-09-11 18:57:30,349 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 18:57:30,783 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 18:57:30,784 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 18:57:30,784 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 18:57:30,784 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 18:57:30,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 18:57:30,786 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 18:57:30,786 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 18:57:30,787 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 9 states. [2018-09-11 18:57:34,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 18:57:34,783 INFO L93 Difference]: Finished difference Result 719 states and 1134 transitions. [2018-09-11 18:57:34,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-11 18:57:34,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2018-09-11 18:57:34,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 18:57:34,790 INFO L225 Difference]: With dead ends: 719 [2018-09-11 18:57:34,791 INFO L226 Difference]: Without dead ends: 513 [2018-09-11 18:57:34,794 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 142 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-11 18:57:34,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-09-11 18:57:34,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 504. [2018-09-11 18:57:34,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-09-11 18:57:34,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 662 transitions. [2018-09-11 18:57:34,831 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 662 transitions. Word has length 136 [2018-09-11 18:57:34,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 18:57:34,832 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 662 transitions. [2018-09-11 18:57:34,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 18:57:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 662 transitions. [2018-09-11 18:57:34,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-11 18:57:34,837 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 18:57:34,837 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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:57:34,837 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:57:34,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1516340516, now seen corresponding path program 1 times [2018-09-11 18:57:34,838 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 18:57:34,838 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2018-09-11 18:57:34,839 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [421], [423], [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:57:34,841 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 18:57:34,842 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 18:57:34,919 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 18:57:34,919 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:57:34,957 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 18:57:35,108 INFO L232 lantSequenceWeakener]: Weakened 142 states. On average, predicates are now at 74.21% of their original sizes. [2018-09-11 18:57:35,109 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 18:57:35,757 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 18:57:35,758 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 18:57:35,758 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 18:57:35,758 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 18:57:35,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 18:57:35,759 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 18:57:35,760 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 18:57:35,760 INFO L87 Difference]: Start difference. First operand 504 states and 662 transitions. Second operand 9 states. [2018-09-11 18:57:39,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 18:57:39,102 INFO L93 Difference]: Finished difference Result 1139 states and 1712 transitions. [2018-09-11 18:57:39,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-11 18:57:39,104 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 145 [2018-09-11 18:57:39,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 18:57:39,111 INFO L225 Difference]: With dead ends: 1139 [2018-09-11 18:57:39,111 INFO L226 Difference]: Without dead ends: 785 [2018-09-11 18:57:39,113 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 151 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-11 18:57:39,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-09-11 18:57:39,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 778. [2018-09-11 18:57:39,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2018-09-11 18:57:39,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 957 transitions. [2018-09-11 18:57:39,152 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 957 transitions. Word has length 145 [2018-09-11 18:57:39,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 18:57:39,153 INFO L480 AbstractCegarLoop]: Abstraction has 778 states and 957 transitions. [2018-09-11 18:57:39,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 18:57:39,153 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 957 transitions. [2018-09-11 18:57:39,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-09-11 18:57:39,159 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 18:57:39,160 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:39,160 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:57:39,161 INFO L82 PathProgramCache]: Analyzing trace with hash 349537324, now seen corresponding path program 1 times [2018-09-11 18:57:39,161 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 18:57:39,161 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2018-09-11 18:57:39,162 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [421], [423], [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:57:39,165 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 18:57:39,165 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 18:57:39,334 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 18:57:39,334 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:57:39,361 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 18:57:39,601 INFO L232 lantSequenceWeakener]: Weakened 178 states. On average, predicates are now at 73.91% of their original sizes. [2018-09-11 18:57:39,601 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 18:57:40,125 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 18:57:40,126 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 18:57:40,126 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 18:57:40,126 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 18:57:40,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 18:57:40,127 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 18:57:40,128 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 18:57:40,128 INFO L87 Difference]: Start difference. First operand 778 states and 957 transitions. Second operand 9 states. [2018-09-11 18:57:43,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 18:57:43,897 INFO L93 Difference]: Finished difference Result 1563 states and 2059 transitions. [2018-09-11 18:57:43,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-11 18:57:43,897 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 181 [2018-09-11 18:57:43,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 18:57:43,903 INFO L225 Difference]: With dead ends: 1563 [2018-09-11 18:57:43,903 INFO L226 Difference]: Without dead ends: 935 [2018-09-11 18:57:43,906 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 187 GetRequests, 173 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:57:43,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2018-09-11 18:57:43,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 928. [2018-09-11 18:57:43,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2018-09-11 18:57:43,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1133 transitions. [2018-09-11 18:57:43,936 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1133 transitions. Word has length 181 [2018-09-11 18:57:43,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 18:57:43,937 INFO L480 AbstractCegarLoop]: Abstraction has 928 states and 1133 transitions. [2018-09-11 18:57:43,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 18:57:43,937 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1133 transitions. [2018-09-11 18:57:43,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-11 18:57:43,942 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 18:57:43,943 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:43,943 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:57:43,943 INFO L82 PathProgramCache]: Analyzing trace with hash -193483157, now seen corresponding path program 1 times [2018-09-11 18:57:43,943 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 18:57:43,944 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 201 with the following transitions: [2018-09-11 18:57:43,944 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [421], [423], [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:57:43,948 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 18:57:43,948 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 18:57:44,142 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 18:57:44,142 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:57:44,180 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 18:57:44,262 INFO L232 lantSequenceWeakener]: Weakened 197 states. On average, predicates are now at 73.73% of their original sizes. [2018-09-11 18:57:44,262 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 18:57:44,390 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 18:57:44,391 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 18:57:44,391 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 18:57:44,391 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 18:57:44,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 18:57:44,391 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 18:57:44,392 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 18:57:44,392 INFO L87 Difference]: Start difference. First operand 928 states and 1133 transitions. Second operand 9 states. [2018-09-11 18:57:47,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 18:57:47,311 INFO L93 Difference]: Finished difference Result 1942 states and 2573 transitions. [2018-09-11 18:57:47,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-11 18:57:47,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 200 [2018-09-11 18:57:47,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 18:57:47,317 INFO L225 Difference]: With dead ends: 1942 [2018-09-11 18:57:47,318 INFO L226 Difference]: Without dead ends: 1164 [2018-09-11 18:57:47,320 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 206 GetRequests, 192 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:57:47,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2018-09-11 18:57:47,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1157. [2018-09-11 18:57:47,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2018-09-11 18:57:47,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1390 transitions. [2018-09-11 18:57:47,353 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1390 transitions. Word has length 200 [2018-09-11 18:57:47,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 18:57:47,354 INFO L480 AbstractCegarLoop]: Abstraction has 1157 states and 1390 transitions. [2018-09-11 18:57:47,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 18:57:47,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1390 transitions. [2018-09-11 18:57:47,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-09-11 18:57:47,359 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 18:57:47,359 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:57:47,359 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:57:47,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1467943719, now seen corresponding path program 1 times [2018-09-11 18:57:47,360 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 18:57:47,360 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2018-09-11 18:57:47,360 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [421], [423], [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:57:47,363 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 18:57:47,363 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 18:57:47,452 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 18:57:47,453 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:57:47,496 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 18:57:47,598 INFO L232 lantSequenceWeakener]: Weakened 220 states. On average, predicates are now at 76.03% of their original sizes. [2018-09-11 18:57:47,599 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 18:57:47,864 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 18:57:47,865 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 18:57:47,865 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 18:57:47,865 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 18:57:47,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 18:57:47,866 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 18:57:47,866 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 18:57:47,866 INFO L87 Difference]: Start difference. First operand 1157 states and 1390 transitions. Second operand 9 states. [2018-09-11 18:57:50,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 18:57:50,327 INFO L93 Difference]: Finished difference Result 2420 states and 3040 transitions. [2018-09-11 18:57:50,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-11 18:57:50,336 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 223 [2018-09-11 18:57:50,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 18:57:50,344 INFO L225 Difference]: With dead ends: 2420 [2018-09-11 18:57:50,344 INFO L226 Difference]: Without dead ends: 1413 [2018-09-11 18:57:50,348 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 229 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-11 18:57:50,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2018-09-11 18:57:50,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1392. [2018-09-11 18:57:50,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states. [2018-09-11 18:57:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1678 transitions. [2018-09-11 18:57:50,386 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1678 transitions. Word has length 223 [2018-09-11 18:57:50,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 18:57:50,386 INFO L480 AbstractCegarLoop]: Abstraction has 1392 states and 1678 transitions. [2018-09-11 18:57:50,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 18:57:50,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1678 transitions. [2018-09-11 18:57:50,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-09-11 18:57:50,392 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 18:57:50,392 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:57:50,392 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:57:50,393 INFO L82 PathProgramCache]: Analyzing trace with hash 14085933, now seen corresponding path program 1 times [2018-09-11 18:57:50,393 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 18:57:50,393 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 250 with the following transitions: [2018-09-11 18:57:50,393 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [421], [423], [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:57:50,395 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 18:57:50,396 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 18:57:50,526 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-11 18:57:50,526 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:57:50,563 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-11 18:57:50,610 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-11 18:57:50,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 06:57:50 BoogieIcfgContainer [2018-09-11 18:57:50,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-11 18:57:50,611 INFO L168 Benchmark]: Toolchain (without parser) took 29130.97 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -875.4 MB). Peak memory consumption was 233.5 MB. Max. memory is 7.1 GB. [2018-09-11 18:57:50,615 INFO L168 Benchmark]: CDTParser took 0.21 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:57:50,615 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.58 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: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2018-09-11 18:57:50,616 INFO L168 Benchmark]: Boogie Procedure Inliner took 140.36 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:57:50,618 INFO L168 Benchmark]: Boogie Preprocessor took 248.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 775.4 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -868.6 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. [2018-09-11 18:57:50,619 INFO L168 Benchmark]: RCFGBuilder took 3716.48 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 122.2 MB). Peak memory consumption was 122.2 MB. Max. memory is 7.1 GB. [2018-09-11 18:57:50,620 INFO L168 Benchmark]: TraceAbstraction took 24243.54 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 333.4 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -173.9 MB). Peak memory consumption was 159.5 MB. Max. memory is 7.1 GB. [2018-09-11 18:57:50,625 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.21 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 775.58 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: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 140.36 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 248.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 775.4 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -868.6 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3716.48 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 122.2 MB). Peak memory consumption was 122.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24243.54 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 333.4 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -173.9 MB). Peak memory consumption was 159.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 178]: 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 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 TRUE (((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)) [L178] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 24.1s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 19.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1221 SDtfs, 3536 SDslu, 1505 SDs, 0 SdLazy, 8913 SolverSat, 1140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.9s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 979 GetRequests, 906 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.2s AbstIntTime, 7 AbstIntIterations, 6 AbstIntStrong, 0.9970190054421917 AbsIntWeakeningRatio, 0.1271186440677966 AbsIntAvgWeakeningVarsNumRemoved, 8.010593220338983 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_label18_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-11_18-57-50-640.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label18_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-11_18-57-50-640.csv Received shutdown request...