java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label47_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ddc4263 [2018-08-08 06:16:38,249 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-08-08 06:16:38,251 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-08-08 06:16:38,265 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-08-08 06:16:38,265 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-08-08 06:16:38,266 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-08-08 06:16:38,268 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-08-08 06:16:38,269 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-08-08 06:16:38,271 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-08-08 06:16:38,272 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-08-08 06:16:38,273 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-08-08 06:16:38,273 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-08-08 06:16:38,274 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-08-08 06:16:38,275 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-08-08 06:16:38,276 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-08-08 06:16:38,277 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-08-08 06:16:38,278 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-08-08 06:16:38,279 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-08-08 06:16:38,281 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-08-08 06:16:38,283 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-08-08 06:16:38,284 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-08-08 06:16:38,285 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-08-08 06:16:38,287 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-08-08 06:16:38,288 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-08-08 06:16:38,288 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-08-08 06:16:38,289 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-08-08 06:16:38,290 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-08-08 06:16:38,291 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-08-08 06:16:38,292 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-08-08 06:16:38,296 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-08-08 06:16:38,297 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-08-08 06:16:38,299 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-08-08 06:16:38,300 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-08-08 06:16:38,300 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-08-08 06:16:38,301 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-08-08 06:16:38,301 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-08-08 06:16:38,302 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf [2018-08-08 06:16:38,332 INFO L110 SettingsManager]: Loading preferences was successful [2018-08-08 06:16:38,332 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-08-08 06:16:38,333 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-08-08 06:16:38,333 INFO L133 SettingsManager]: * User list type=DISABLED [2018-08-08 06:16:38,335 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-08-08 06:16:38,336 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-08-08 06:16:38,336 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-08-08 06:16:38,336 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-08-08 06:16:38,336 INFO L133 SettingsManager]: * Log string format=TERM [2018-08-08 06:16:38,336 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-08-08 06:16:38,337 INFO L133 SettingsManager]: * Interval Domain=false [2018-08-08 06:16:38,337 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-08-08 06:16:38,338 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-08-08 06:16:38,338 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-08-08 06:16:38,338 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-08-08 06:16:38,338 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-08-08 06:16:38,338 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-08-08 06:16:38,339 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-08-08 06:16:38,340 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-08-08 06:16:38,340 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-08-08 06:16:38,340 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-08-08 06:16:38,340 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-08-08 06:16:38,341 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-08-08 06:16:38,341 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-08-08 06:16:38,341 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-08-08 06:16:38,341 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-08-08 06:16:38,342 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-08-08 06:16:38,342 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-08-08 06:16:38,342 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-08-08 06:16:38,342 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-08-08 06:16:38,342 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-08-08 06:16:38,342 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-08-08 06:16:38,343 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-08-08 06:16:38,391 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-08-08 06:16:38,406 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-08-08 06:16:38,412 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-08-08 06:16:38,414 INFO L271 PluginConnector]: Initializing CDTParser... [2018-08-08 06:16:38,414 INFO L276 PluginConnector]: CDTParser initialized [2018-08-08 06:16:38,415 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label47_true-unreach-call_false-termination.c [2018-08-08 06:16:38,773 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3533767dd/50ccfcd7288c48aa90c93ab5599a3c5f/FLAG37a0b3ec9 [2018-08-08 06:16:39,040 INFO L276 CDTParser]: Found 1 translation units. [2018-08-08 06:16:39,041 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label47_true-unreach-call_false-termination.c [2018-08-08 06:16:39,076 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3533767dd/50ccfcd7288c48aa90c93ab5599a3c5f/FLAG37a0b3ec9 [2018-08-08 06:16:39,100 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3533767dd/50ccfcd7288c48aa90c93ab5599a3c5f [2018-08-08 06:16:39,112 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-08-08 06:16:39,114 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-08-08 06:16:39,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-08-08 06:16:39,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-08-08 06:16:39,121 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-08-08 06:16:39,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.08 06:16:39" (1/1) ... [2018-08-08 06:16:39,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40baefcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:16:39, skipping insertion in model container [2018-08-08 06:16:39,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.08 06:16:39" (1/1) ... [2018-08-08 06:16:39,396 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-08-08 06:16:39,761 INFO L175 PostProcessor]: Settings: Checked method=main [2018-08-08 06:16:39,777 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-08-08 06:16:39,960 INFO L175 PostProcessor]: Settings: Checked method=main [2018-08-08 06:16:40,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:16:40 WrapperNode [2018-08-08 06:16:40,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-08-08 06:16:40,013 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-08-08 06:16:40,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-08-08 06:16:40,014 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-08-08 06:16:40,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:16:40" (1/1) ... [2018-08-08 06:16:40,055 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:16:40" (1/1) ... [2018-08-08 06:16:40,167 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-08-08 06:16:40,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-08-08 06:16:40,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-08-08 06:16:40,168 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-08-08 06:16:40,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:16:40" (1/1) ... [2018-08-08 06:16:40,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:16:40" (1/1) ... [2018-08-08 06:16:40,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:16:40" (1/1) ... [2018-08-08 06:16:40,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:16:40" (1/1) ... [2018-08-08 06:16:40,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:16:40" (1/1) ... [2018-08-08 06:16:40,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:16:40" (1/1) ... [2018-08-08 06:16:40,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:16:40" (1/1) ... [2018-08-08 06:16:40,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-08-08 06:16:40,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-08-08 06:16:40,499 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-08-08 06:16:40,499 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-08-08 06:16:40,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:16:40" (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-08-08 06:16:40,575 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-08-08 06:16:40,575 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-08-08 06:16:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-08-08 06:16:40,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-08-08 06:16:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-08-08 06:16:40,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-08-08 06:16:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-08-08 06:16:40,578 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-08-08 06:16:44,466 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-08-08 06:16:44,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.08 06:16:44 BoogieIcfgContainer [2018-08-08 06:16:44,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-08-08 06:16:44,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-08-08 06:16:44,471 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-08-08 06:16:44,478 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-08-08 06:16:44,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.08 06:16:39" (1/3) ... [2018-08-08 06:16:44,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c01bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.08 06:16:44, skipping insertion in model container [2018-08-08 06:16:44,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 06:16:40" (2/3) ... [2018-08-08 06:16:44,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c01bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.08 06:16:44, skipping insertion in model container [2018-08-08 06:16:44,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.08 06:16:44" (3/3) ... [2018-08-08 06:16:44,487 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label47_true-unreach-call_false-termination.c [2018-08-08 06:16:44,499 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-08-08 06:16:44,515 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-08-08 06:16:44,568 INFO L129 ementStrategyFactory]: Using default assertion order modulation [2018-08-08 06:16:44,569 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-08-08 06:16:44,569 INFO L382 AbstractCegarLoop]: Hoare is true [2018-08-08 06:16:44,569 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-08-08 06:16:44,570 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-08-08 06:16:44,570 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-08-08 06:16:44,570 INFO L386 AbstractCegarLoop]: Difference is false [2018-08-08 06:16:44,570 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-08-08 06:16:44,570 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-08-08 06:16:44,597 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-08-08 06:16:44,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-08-08 06:16:44,606 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 06:16:44,607 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] [2018-08-08 06:16:44,608 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 06:16:44,614 INFO L82 PathProgramCache]: Analyzing trace with hash -443843092, now seen corresponding path program 1 times [2018-08-08 06:16:44,616 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 06:16:44,618 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-08-08 06:16:44,620 INFO L202 CegarAbsIntRunner]: [0], [7], [15], [23], [31], [39], [47], [55], [63], [71], [79], [87], [95], [103], [111], [119], [127], [135], [143], [151], [159], [167], [175], [183], [191], [199], [207], [215], [219], [221], [947], [948], [952], [956], [962], [966], [973], [974], [975], [977] [2018-08-08 06:16:44,704 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-08-08 06:16:44,704 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 06:16:45,921 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 06:16:45,922 INFO L272 AbstractInterpreter]: Visited 39 different actions 39 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-08-08 06:16:45,935 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 06:16:46,569 INFO L232 lantSequenceWeakener]: Weakened 38 states. On average, predicates are now at 80.09% of their original sizes. [2018-08-08 06:16:46,570 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 06:16:46,906 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 06:16:46,907 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 06:16:46,908 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-08-08 06:16:46,908 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 06:16:46,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-08-08 06:16:46,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-08-08 06:16:46,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-08-08 06:16:46,926 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 6 states. [2018-08-08 06:16:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 06:16:50,908 INFO L93 Difference]: Finished difference Result 693 states and 1229 transitions. [2018-08-08 06:16:50,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-08-08 06:16:50,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-08-08 06:16:50,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 06:16:50,930 INFO L225 Difference]: With dead ends: 693 [2018-08-08 06:16:50,930 INFO L226 Difference]: Without dead ends: 436 [2018-08-08 06:16:50,938 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-08-08 06:16:50,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-08-08 06:16:51,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2018-08-08 06:16:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-08-08 06:16:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 615 transitions. [2018-08-08 06:16:51,015 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 615 transitions. Word has length 40 [2018-08-08 06:16:51,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 06:16:51,015 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 615 transitions. [2018-08-08 06:16:51,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-08-08 06:16:51,016 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 615 transitions. [2018-08-08 06:16:51,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-08-08 06:16:51,022 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 06:16:51,022 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-08 06:16:51,023 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 06:16:51,023 INFO L82 PathProgramCache]: Analyzing trace with hash -777572711, now seen corresponding path program 1 times [2018-08-08 06:16:51,023 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 06:16:51,023 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2018-08-08 06:16:51,024 INFO L202 CegarAbsIntRunner]: [0], [7], [15], [23], [31], [39], [47], [55], [63], [71], [79], [87], [95], [103], [111], [119], [127], [135], [143], [151], [159], [167], [175], [183], [191], [199], [207], [215], [219], [221], [224], [232], [240], [248], [256], [264], [272], [280], [288], [296], [304], [312], [320], [328], [336], [344], [352], [360], [368], [376], [384], [392], [400], [408], [416], [424], [432], [440], [448], [456], [464], [472], [480], [488], [493], [497], [501], [505], [509], [513], [517], [521], [525], [529], [533], [537], [541], [545], [549], [552], [946], [947], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-08-08 06:16:51,031 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-08-08 06:16:51,031 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 06:17:01,425 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 06:17:01,426 INFO L272 AbstractInterpreter]: Visited 92 different actions 177 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-08-08 06:17:01,443 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 06:17:05,053 INFO L232 lantSequenceWeakener]: Weakened 123 states. On average, predicates are now at 78.25% of their original sizes. [2018-08-08 06:17:05,054 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 06:17:06,587 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 06:17:06,587 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 06:17:06,588 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-08-08 06:17:06,588 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 06:17:06,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-08-08 06:17:06,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-08-08 06:17:06,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-08-08 06:17:06,591 INFO L87 Difference]: Start difference. First operand 434 states and 615 transitions. Second operand 11 states. [2018-08-08 06:17:22,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 06:17:22,208 INFO L93 Difference]: Finished difference Result 1051 states and 1763 transitions. [2018-08-08 06:17:22,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-08-08 06:17:22,210 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 125 [2018-08-08 06:17:22,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 06:17:22,216 INFO L225 Difference]: With dead ends: 1051 [2018-08-08 06:17:22,217 INFO L226 Difference]: Without dead ends: 806 [2018-08-08 06:17:22,220 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 131 GetRequests, 87 SyntacticMatches, 28 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-08-08 06:17:22,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-08-08 06:17:22,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 803. [2018-08-08 06:17:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2018-08-08 06:17:22,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1002 transitions. [2018-08-08 06:17:22,288 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1002 transitions. Word has length 125 [2018-08-08 06:17:22,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 06:17:22,290 INFO L480 AbstractCegarLoop]: Abstraction has 803 states and 1002 transitions. [2018-08-08 06:17:22,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-08-08 06:17:22,290 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1002 transitions. [2018-08-08 06:17:22,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-08-08 06:17:22,297 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 06:17:22,297 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-08 06:17:22,298 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 06:17:22,298 INFO L82 PathProgramCache]: Analyzing trace with hash -812080059, now seen corresponding path program 1 times [2018-08-08 06:17:22,298 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 06:17:22,299 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-08-08 06:17:22,299 INFO L202 CegarAbsIntRunner]: [0], [7], [15], [23], [31], [39], [47], [55], [63], [71], [79], [87], [95], [103], [111], [119], [127], [135], [143], [151], [159], [167], [175], [183], [191], [199], [207], [215], [219], [221], [224], [232], [240], [248], [256], [264], [272], [280], [288], [296], [304], [312], [320], [328], [336], [344], [352], [360], [368], [376], [384], [392], [400], [408], [416], [424], [432], [440], [448], [456], [464], [472], [480], [488], [493], [497], [501], [505], [509], [513], [517], [521], [525], [529], [533], [537], [541], [545], [549], [553], [557], [561], [565], [569], [573], [577], [581], [585], [589], [593], [597], [601], [605], [609], [613], [617], [621], [625], [629], [633], [637], [641], [645], [649], [653], [656], [946], [947], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-08-08 06:17:22,305 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-08-08 06:17:22,305 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 06:17:43,436 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 06:17:43,437 INFO L272 AbstractInterpreter]: Visited 118 different actions 230 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-08-08 06:17:43,443 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 06:17:51,581 INFO L232 lantSequenceWeakener]: Weakened 149 states. On average, predicates are now at 78.08% of their original sizes. [2018-08-08 06:17:51,581 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 06:17:52,644 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 06:17:52,645 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 06:17:52,645 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-08-08 06:17:52,645 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 06:17:52,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-08-08 06:17:52,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-08-08 06:17:52,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-08-08 06:17:52,648 INFO L87 Difference]: Start difference. First operand 803 states and 1002 transitions. Second operand 11 states. [2018-08-08 06:18:04,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 06:18:04,651 INFO L93 Difference]: Finished difference Result 1236 states and 1786 transitions. [2018-08-08 06:18:04,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-08-08 06:18:04,656 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 151 [2018-08-08 06:18:04,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 06:18:04,662 INFO L225 Difference]: With dead ends: 1236 [2018-08-08 06:18:04,662 INFO L226 Difference]: Without dead ends: 991 [2018-08-08 06:18:04,664 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 158 GetRequests, 113 SyntacticMatches, 28 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-08-08 06:18:04,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2018-08-08 06:18:04,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 988. [2018-08-08 06:18:04,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-08-08 06:18:04,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1200 transitions. [2018-08-08 06:18:04,704 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1200 transitions. Word has length 151 [2018-08-08 06:18:04,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 06:18:04,705 INFO L480 AbstractCegarLoop]: Abstraction has 988 states and 1200 transitions. [2018-08-08 06:18:04,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-08-08 06:18:04,705 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1200 transitions. [2018-08-08 06:18:04,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-08-08 06:18:04,711 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 06:18:04,711 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-08-08 06:18:04,712 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 06:18:04,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1457569800, now seen corresponding path program 1 times [2018-08-08 06:18:04,712 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 06:18:04,712 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 237 with the following transitions: [2018-08-08 06:18:04,713 INFO L202 CegarAbsIntRunner]: [0], [7], [15], [23], [31], [39], [47], [55], [63], [71], [79], [87], [95], [103], [111], [119], [127], [135], [143], [151], [159], [167], [175], [183], [191], [199], [207], [215], [219], [221], [224], [232], [240], [248], [256], [264], [272], [280], [288], [296], [304], [312], [320], [328], [336], [344], [352], [360], [368], [376], [384], [392], [400], [408], [416], [424], [432], [440], [448], [456], [464], [472], [480], [488], [493], [497], [501], [505], [509], [513], [517], [521], [525], [529], [533], [537], [541], [545], [549], [552], [553], [557], [561], [565], [569], [573], [577], [581], [585], [589], [593], [597], [601], [605], [609], [613], [617], [621], [625], [629], [633], [637], [641], [645], [649], [653], [656], [946], [947], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-08-08 06:18:04,718 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-08-08 06:18:04,718 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 06:18:23,154 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 06:18:23,155 INFO L272 AbstractInterpreter]: Visited 119 different actions 352 times. Merged at 7 different actions 17 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-08-08 06:18:23,159 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 06:18:26,414 INFO L232 lantSequenceWeakener]: Weakened 234 states. On average, predicates are now at 77.81% of their original sizes. [2018-08-08 06:18:26,415 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 06:18:27,150 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 06:18:27,151 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 06:18:27,151 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-08-08 06:18:27,151 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 06:18:27,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-08-08 06:18:27,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-08-08 06:18:27,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-08-08 06:18:27,153 INFO L87 Difference]: Start difference. First operand 988 states and 1200 transitions. Second operand 15 states. [2018-08-08 06:18:46,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 06:18:46,251 INFO L93 Difference]: Finished difference Result 1967 states and 3058 transitions. [2018-08-08 06:18:46,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-08-08 06:18:46,262 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 236 [2018-08-08 06:18:46,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 06:18:46,276 INFO L225 Difference]: With dead ends: 1967 [2018-08-08 06:18:46,276 INFO L226 Difference]: Without dead ends: 1722 [2018-08-08 06:18:46,279 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 251 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=208, Invalid=722, Unknown=0, NotChecked=0, Total=930 [2018-08-08 06:18:46,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2018-08-08 06:18:46,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1422. [2018-08-08 06:18:46,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1422 states. [2018-08-08 06:18:46,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 1686 transitions. [2018-08-08 06:18:46,334 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 1686 transitions. Word has length 236 [2018-08-08 06:18:46,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 06:18:46,334 INFO L480 AbstractCegarLoop]: Abstraction has 1422 states and 1686 transitions. [2018-08-08 06:18:46,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-08-08 06:18:46,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1686 transitions. [2018-08-08 06:18:46,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-08-08 06:18:46,340 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 06:18:46,341 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-08-08 06:18:46,341 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 06:18:46,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1924720665, now seen corresponding path program 1 times [2018-08-08 06:18:46,342 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 06:18:46,342 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 262 with the following transitions: [2018-08-08 06:18:46,342 INFO L202 CegarAbsIntRunner]: [0], [7], [15], [23], [31], [39], [47], [55], [63], [71], [79], [87], [95], [103], [111], [119], [127], [135], [143], [151], [159], [167], [175], [183], [191], [199], [207], [215], [219], [221], [224], [232], [240], [248], [256], [264], [272], [280], [288], [296], [304], [312], [320], [328], [336], [344], [352], [360], [368], [376], [384], [392], [400], [408], [416], [424], [432], [440], [448], [456], [464], [472], [480], [488], [493], [497], [501], [505], [509], [513], [517], [521], [525], [529], [533], [537], [541], [545], [549], [553], [557], [561], [565], [569], [573], [577], [581], [585], [589], [593], [597], [601], [605], [609], [613], [617], [621], [625], [629], [633], [637], [641], [645], [649], [652], [653], [656], [946], [947], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-08-08 06:18:46,349 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-08-08 06:18:46,350 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 06:19:11,059 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-08-08 06:19:29,497 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 06:19:29,497 INFO L272 AbstractInterpreter]: Visited 119 different actions 465 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-08-08 06:19:29,537 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 06:19:33,809 INFO L232 lantSequenceWeakener]: Weakened 259 states. On average, predicates are now at 77.78% of their original sizes. [2018-08-08 06:19:33,810 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 06:19:37,298 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 06:19:37,298 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 06:19:37,298 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-08-08 06:19:37,298 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 06:19:37,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-08-08 06:19:37,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-08-08 06:19:37,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-08-08 06:19:37,300 INFO L87 Difference]: Start difference. First operand 1422 states and 1686 transitions. Second operand 11 states. [2018-08-08 06:19:47,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 06:19:47,974 INFO L93 Difference]: Finished difference Result 1861 states and 2476 transitions. [2018-08-08 06:19:47,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-08-08 06:19:47,974 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 261 [2018-08-08 06:19:47,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 06:19:47,983 INFO L225 Difference]: With dead ends: 1861 [2018-08-08 06:19:47,984 INFO L226 Difference]: Without dead ends: 1616 [2018-08-08 06:19:47,986 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 269 GetRequests, 223 SyntacticMatches, 28 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-08-08 06:19:47,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2018-08-08 06:19:48,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1609. [2018-08-08 06:19:48,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2018-08-08 06:19:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 1904 transitions. [2018-08-08 06:19:48,039 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 1904 transitions. Word has length 261 [2018-08-08 06:19:48,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 06:19:48,040 INFO L480 AbstractCegarLoop]: Abstraction has 1609 states and 1904 transitions. [2018-08-08 06:19:48,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-08-08 06:19:48,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 1904 transitions. [2018-08-08 06:19:48,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-08-08 06:19:48,047 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 06:19:48,048 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-08-08 06:19:48,048 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 06:19:48,048 INFO L82 PathProgramCache]: Analyzing trace with hash 343243565, now seen corresponding path program 1 times [2018-08-08 06:19:48,048 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 06:19:48,049 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 340 with the following transitions: [2018-08-08 06:19:48,049 INFO L202 CegarAbsIntRunner]: [0], [7], [15], [23], [31], [39], [47], [55], [63], [71], [79], [87], [95], [103], [111], [119], [127], [135], [143], [151], [159], [167], [175], [183], [191], [199], [207], [215], [219], [221], [224], [232], [240], [248], [256], [264], [272], [280], [288], [296], [304], [312], [320], [328], [336], [344], [352], [360], [368], [376], [384], [392], [400], [408], [416], [424], [432], [440], [448], [456], [464], [472], [480], [488], [493], [497], [501], [505], [509], [513], [517], [521], [524], [525], [529], [533], [537], [541], [545], [549], [553], [557], [561], [565], [569], [573], [577], [581], [585], [589], [593], [597], [601], [605], [609], [613], [617], [621], [625], [629], [633], [637], [641], [645], [649], [652], [653], [656], [946], [947], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-08-08 06:19:48,053 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-08-08 06:19:48,053 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 06:20:10,110 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-08-08 06:20:28,137 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-08-08 06:20:28,138 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-08-08 06:20:28,139 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-08-08 06:20:28,190 WARN L205 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-08-08 06:20:28,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.08 06:20:28 BoogieIcfgContainer [2018-08-08 06:20:28,191 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-08-08 06:20:28,192 INFO L168 Benchmark]: Toolchain (without parser) took 229079.49 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.9 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2018-08-08 06:20:28,195 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-08-08 06:20:28,195 INFO L168 Benchmark]: CACSL2BoogieTranslator took 898.24 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-08-08 06:20:28,197 INFO L168 Benchmark]: Boogie Procedure Inliner took 153.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-08-08 06:20:28,197 INFO L168 Benchmark]: Boogie Preprocessor took 327.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 788.5 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -890.1 MB). Peak memory consumption was 34.6 MB. Max. memory is 7.1 GB. [2018-08-08 06:20:28,198 INFO L168 Benchmark]: RCFGBuilder took 3968.54 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: 134.5 MB). Peak memory consumption was 134.5 MB. Max. memory is 7.1 GB. [2018-08-08 06:20:28,200 INFO L168 Benchmark]: TraceAbstraction took 223720.99 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-08-08 06:20:28,205 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 898.24 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 153.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 327.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 788.5 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -890.1 MB). Peak memory consumption was 34.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3968.54 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: 134.5 MB). Peak memory consumption was 134.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 223720.99 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 103]: 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 inputD = 4; [L8] int inputB = 2; [L9] int inputC = 3; [L10] int inputF = 6; [L11] int inputE = 5; [L12] int inputA = 1; [L15] int a21 = 7; [L16] int a15 = 8; [L17] int a12 = -49; [L18] int a24 = 1; [L877] int output = -1; [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL, EXPR calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L183] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) [L186] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L189] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) [L192] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L195] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L198] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) [L201] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L205] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) [L211] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) [L217] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) [L223] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) [L229] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) [L235] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) [L241] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) [L247] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) [L252] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) [L258] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) [L264] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) [L269] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) [L275] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) [L280] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) [L286] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) [L293] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) [L299] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) [L305] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) [L311] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) [L317] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) [L323] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) [L329] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) [L335] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) [L341] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) [L347] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) [L353] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) [L359] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) [L366] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) [L372] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) [L378] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) [L384] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) [L390] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) [L396] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) [L402] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) [L408] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) [L414] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) [L420] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) [L426] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) [L432] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) [L438] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) [L444] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) [L449] COND TRUE (((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8)) [L451] a21 = 10 [L453] RET return 22; [L888] EXPR calculate_output(input) [L888] output = calculate_output(input) [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL, EXPR calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L183] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) [L186] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L189] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) [L192] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L195] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L198] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) [L201] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L205] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) [L211] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) [L217] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) [L223] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) [L229] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) [L235] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) [L241] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) [L247] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) [L252] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) [L258] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) [L264] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) [L269] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) [L275] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) [L280] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) [L286] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) [L293] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) [L299] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) [L305] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) [L311] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) [L317] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) [L323] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) [L329] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) [L335] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) [L341] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) [L347] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) [L353] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) [L359] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) [L366] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) [L372] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) [L378] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) [L384] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) [L390] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) [L396] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) [L402] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) [L408] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) [L414] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) [L420] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) [L426] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) [L432] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) [L438] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) [L444] COND TRUE ((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8)) [L445] a12 = ((((a12 % 26)+ -1) / 5) / 5) [L446] a21 = 7 [L448] RET return 25; [L888] EXPR calculate_output(input) [L888] output = calculate_output(input) [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL, EXPR calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L183] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) [L186] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L189] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) [L192] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L195] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L198] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) [L201] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L205] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) [L211] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) [L217] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) [L223] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) [L229] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) [L235] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) [L241] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) [L247] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) [L252] COND TRUE ((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8)) [L253] a12 = ((((a12 - 438298) * 1) + 564710) - 684902) [L254] a15 = 5 [L255] a21 = 6 [L257] RET return -1; [L888] EXPR calculate_output(input) [L888] output = calculate_output(input) [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND TRUE ((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9)) [L103] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. UNKNOWN Result, 223.6s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 61.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1204 SDtfs, 5661 SDslu, 1781 SDs, 0 SdLazy, 11700 SolverSat, 1612 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 55.2s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 848 GetRequests, 680 SyntacticMatches, 84 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1609occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 134.6s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.9939574120455523 AbsIntWeakeningRatio, 0.1311881188118812 AbsIntAvgWeakeningVarsNumRemoved, 313.34034653465346 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 315 StatesRemovedByMinimization, 5 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/Problem14_label47_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-08-08_06-20-28-220.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label47_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-08-08_06-20-28-220.csv Completed graceful shutdown