java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label23_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ddc4263 [2018-08-08 14:09:17,911 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-08-08 14:09:17,913 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-08-08 14:09:17,931 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-08-08 14:09:17,931 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-08-08 14:09:17,932 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-08-08 14:09:17,934 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-08-08 14:09:17,935 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-08-08 14:09:17,937 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-08-08 14:09:17,938 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-08-08 14:09:17,939 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-08-08 14:09:17,939 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-08-08 14:09:17,940 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-08-08 14:09:17,941 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-08-08 14:09:17,943 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-08-08 14:09:17,943 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-08-08 14:09:17,944 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-08-08 14:09:17,946 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-08-08 14:09:17,948 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-08-08 14:09:17,950 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-08-08 14:09:17,951 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-08-08 14:09:17,952 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-08-08 14:09:17,955 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-08-08 14:09:17,955 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-08-08 14:09:17,955 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-08-08 14:09:17,956 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-08-08 14:09:17,957 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-08-08 14:09:17,958 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-08-08 14:09:17,959 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-08-08 14:09:17,960 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-08-08 14:09:17,961 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-08-08 14:09:17,961 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-08-08 14:09:17,962 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-08-08 14:09:17,962 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-08-08 14:09:17,963 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-08-08 14:09:17,964 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-08-08 14:09:17,964 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf [2018-08-08 14:09:17,979 INFO L110 SettingsManager]: Loading preferences was successful [2018-08-08 14:09:17,980 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-08-08 14:09:17,981 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-08-08 14:09:17,981 INFO L133 SettingsManager]: * User list type=DISABLED [2018-08-08 14:09:17,981 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-08-08 14:09:17,981 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-08-08 14:09:17,981 INFO L133 SettingsManager]: * Congruence Domain=false [2018-08-08 14:09:17,982 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-08-08 14:09:17,982 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2018-08-08 14:09:17,982 INFO L133 SettingsManager]: * Log string format=TERM [2018-08-08 14:09:17,982 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-08-08 14:09:17,982 INFO L133 SettingsManager]: * Interval Domain=false [2018-08-08 14:09:17,983 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-08-08 14:09:17,983 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-08-08 14:09:17,984 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-08-08 14:09:17,984 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-08-08 14:09:17,984 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-08-08 14:09:17,984 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-08-08 14:09:17,984 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-08-08 14:09:17,985 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-08-08 14:09:17,985 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-08-08 14:09:17,985 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-08-08 14:09:17,985 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-08-08 14:09:17,985 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-08-08 14:09:17,986 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-08-08 14:09:17,986 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-08-08 14:09:17,986 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-08-08 14:09:17,986 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-08-08 14:09:17,986 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-08-08 14:09:17,987 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-08-08 14:09:17,987 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-08-08 14:09:17,987 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-08-08 14:09:17,987 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-08-08 14:09:17,987 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-08-08 14:09:18,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-08-08 14:09:18,050 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-08-08 14:09:18,057 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-08-08 14:09:18,058 INFO L271 PluginConnector]: Initializing CDTParser... [2018-08-08 14:09:18,059 INFO L276 PluginConnector]: CDTParser initialized [2018-08-08 14:09:18,060 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label23_true-unreach-call_false-termination.c [2018-08-08 14:09:18,422 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05cb46c21/081fd15918ad4e5f97f81b603e11909a/FLAG760c92896 [2018-08-08 14:09:18,711 INFO L276 CDTParser]: Found 1 translation units. [2018-08-08 14:09:18,712 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label23_true-unreach-call_false-termination.c [2018-08-08 14:09:18,733 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05cb46c21/081fd15918ad4e5f97f81b603e11909a/FLAG760c92896 [2018-08-08 14:09:18,753 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05cb46c21/081fd15918ad4e5f97f81b603e11909a [2018-08-08 14:09:18,766 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-08-08 14:09:18,769 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-08-08 14:09:18,770 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-08-08 14:09:18,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-08-08 14:09:18,777 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-08-08 14:09:18,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.08 02:09:18" (1/1) ... [2018-08-08 14:09:18,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@319e9e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:18, skipping insertion in model container [2018-08-08 14:09:18,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.08 02:09:18" (1/1) ... [2018-08-08 14:09:18,992 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-08-08 14:09:19,323 INFO L175 PostProcessor]: Settings: Checked method=main [2018-08-08 14:09:19,345 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-08-08 14:09:19,557 INFO L175 PostProcessor]: Settings: Checked method=main [2018-08-08 14:09:19,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:19 WrapperNode [2018-08-08 14:09:19,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-08-08 14:09:19,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-08-08 14:09:19,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-08-08 14:09:19,610 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-08-08 14:09:19,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:19" (1/1) ... [2018-08-08 14:09:19,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:19" (1/1) ... [2018-08-08 14:09:19,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-08-08 14:09:19,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-08-08 14:09:19,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-08-08 14:09:19,740 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-08-08 14:09:19,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:19" (1/1) ... [2018-08-08 14:09:19,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:19" (1/1) ... [2018-08-08 14:09:19,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:19" (1/1) ... [2018-08-08 14:09:19,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:19" (1/1) ... [2018-08-08 14:09:19,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:19" (1/1) ... [2018-08-08 14:09:20,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:19" (1/1) ... [2018-08-08 14:09:20,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:19" (1/1) ... [2018-08-08 14:09:20,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-08-08 14:09:20,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-08-08 14:09:20,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-08-08 14:09:20,051 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-08-08 14:09:20,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:19" (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 14:09:20,136 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 14:09:20,137 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 14:09:20,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-08-08 14:09:20,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-08-08 14:09:20,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-08-08 14:09:20,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-08-08 14:09:20,138 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-08-08 14:09:20,138 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-08-08 14:09:23,995 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-08-08 14:09:23,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.08 02:09:23 BoogieIcfgContainer [2018-08-08 14:09:23,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-08-08 14:09:23,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-08-08 14:09:23,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-08-08 14:09:24,007 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-08-08 14:09:24,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.08 02:09:18" (1/3) ... [2018-08-08 14:09:24,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@479d5624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.08 02:09:24, skipping insertion in model container [2018-08-08 14:09:24,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:19" (2/3) ... [2018-08-08 14:09:24,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@479d5624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.08 02:09:24, skipping insertion in model container [2018-08-08 14:09:24,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.08 02:09:23" (3/3) ... [2018-08-08 14:09:24,011 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label23_true-unreach-call_false-termination.c [2018-08-08 14:09:24,021 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-08-08 14:09:24,031 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-08-08 14:09:24,083 INFO L129 ementStrategyFactory]: Using default assertion order modulation [2018-08-08 14:09:24,084 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-08-08 14:09:24,084 INFO L382 AbstractCegarLoop]: Hoare is true [2018-08-08 14:09:24,084 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-08-08 14:09:24,084 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-08-08 14:09:24,085 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-08-08 14:09:24,085 INFO L386 AbstractCegarLoop]: Difference is false [2018-08-08 14:09:24,085 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-08-08 14:09:24,085 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-08-08 14:09:24,120 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-08-08 14:09:24,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-08-08 14:09:24,130 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 14:09:24,131 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] [2018-08-08 14:09:24,133 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 14:09:24,138 INFO L82 PathProgramCache]: Analyzing trace with hash -845601649, now seen corresponding path program 1 times [2018-08-08 14:09:24,143 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 14:09:24,144 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-08-08 14:09:24,147 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], [211], [213], [947], [948], [952], [956], [962], [966], [973], [974], [975], [977] [2018-08-08 14:09:24,206 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-08-08 14:09:24,206 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 14:09:25,677 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 14:09:25,678 INFO L272 AbstractInterpreter]: Visited 38 different actions 38 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-08-08 14:09:25,694 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 14:09:26,397 INFO L232 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 80.05% of their original sizes. [2018-08-08 14:09:26,398 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 14:09:26,751 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 14:09:26,753 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 14:09:26,753 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-08-08 14:09:26,753 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 14:09:26,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-08-08 14:09:26,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-08-08 14:09:26,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-08-08 14:09:26,769 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 6 states. [2018-08-08 14:09:30,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 14:09:30,929 INFO L93 Difference]: Finished difference Result 693 states and 1229 transitions. [2018-08-08 14:09:30,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-08-08 14:09:30,934 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-08-08 14:09:30,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 14:09:30,954 INFO L225 Difference]: With dead ends: 693 [2018-08-08 14:09:30,954 INFO L226 Difference]: Without dead ends: 436 [2018-08-08 14:09:30,963 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 38 GetRequests, 34 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 14:09:30,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-08-08 14:09:31,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2018-08-08 14:09:31,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-08-08 14:09:31,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 615 transitions. [2018-08-08 14:09:31,059 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 615 transitions. Word has length 39 [2018-08-08 14:09:31,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 14:09:31,060 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 615 transitions. [2018-08-08 14:09:31,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-08-08 14:09:31,060 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 615 transitions. [2018-08-08 14:09:31,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-08-08 14:09:31,072 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 14:09:31,073 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:09:31,073 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 14:09:31,076 INFO L82 PathProgramCache]: Analyzing trace with hash -526042237, now seen corresponding path program 1 times [2018-08-08 14:09:31,076 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 14:09:31,076 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 125 with the following transitions: [2018-08-08 14:09:31,077 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], [211], [213], [216], [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 14:09:31,092 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-08-08 14:09:31,092 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 14:09:39,782 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 14:09:39,783 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 14:09:39,818 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 14:09:41,933 INFO L232 lantSequenceWeakener]: Weakened 122 states. On average, predicates are now at 78.19% of their original sizes. [2018-08-08 14:09:41,934 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 14:09:44,955 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 14:09:44,956 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 14:09:44,956 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-08-08 14:09:44,956 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 14:09:44,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-08-08 14:09:44,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-08-08 14:09:44,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-08-08 14:09:44,959 INFO L87 Difference]: Start difference. First operand 434 states and 615 transitions. Second operand 14 states. [2018-08-08 14:10:01,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 14:10:01,752 INFO L93 Difference]: Finished difference Result 1340 states and 2335 transitions. [2018-08-08 14:10:01,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-08-08 14:10:01,753 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 124 [2018-08-08 14:10:01,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 14:10:01,763 INFO L225 Difference]: With dead ends: 1340 [2018-08-08 14:10:01,763 INFO L226 Difference]: Without dead ends: 1095 [2018-08-08 14:10:01,769 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 136 GetRequests, 91 SyntacticMatches, 20 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2018-08-08 14:10:01,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-08-08 14:10:01,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 850. [2018-08-08 14:10:01,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2018-08-08 14:10:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1058 transitions. [2018-08-08 14:10:01,847 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1058 transitions. Word has length 124 [2018-08-08 14:10:01,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 14:10:01,848 INFO L480 AbstractCegarLoop]: Abstraction has 850 states and 1058 transitions. [2018-08-08 14:10:01,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-08-08 14:10:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1058 transitions. [2018-08-08 14:10:01,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-08-08 14:10:01,861 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 14:10:01,861 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:10:01,862 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 14:10:01,862 INFO L82 PathProgramCache]: Analyzing trace with hash 906649879, now seen corresponding path program 1 times [2018-08-08 14:10:01,862 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 14:10:01,862 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 151 with the following transitions: [2018-08-08 14:10:01,863 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], [211], [213], [216], [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 14:10:01,868 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-08-08 14:10:01,869 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 14:10:12,226 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 14:10:12,227 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 14:10:12,235 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 14:10:14,143 INFO L232 lantSequenceWeakener]: Weakened 148 states. On average, predicates are now at 78.03% of their original sizes. [2018-08-08 14:10:14,144 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 14:10:14,636 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 14:10:14,636 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 14:10:14,636 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-08-08 14:10:14,636 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 14:10:14,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-08-08 14:10:14,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-08-08 14:10:14,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-08-08 14:10:14,638 INFO L87 Difference]: Start difference. First operand 850 states and 1058 transitions. Second operand 12 states. [2018-08-08 14:10:22,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 14:10:22,926 INFO L93 Difference]: Finished difference Result 1283 states and 1842 transitions. [2018-08-08 14:10:22,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-08-08 14:10:22,929 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2018-08-08 14:10:22,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 14:10:22,939 INFO L225 Difference]: With dead ends: 1283 [2018-08-08 14:10:22,939 INFO L226 Difference]: Without dead ends: 1038 [2018-08-08 14:10:22,941 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 158 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2018-08-08 14:10:22,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2018-08-08 14:10:22,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1035. [2018-08-08 14:10:22,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2018-08-08 14:10:22,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1256 transitions. [2018-08-08 14:10:22,999 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1256 transitions. Word has length 150 [2018-08-08 14:10:23,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 14:10:23,000 INFO L480 AbstractCegarLoop]: Abstraction has 1035 states and 1256 transitions. [2018-08-08 14:10:23,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-08-08 14:10:23,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1256 transitions. [2018-08-08 14:10:23,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-08-08 14:10:23,010 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 14:10:23,010 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 14:10:23,011 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 14:10:23,011 INFO L82 PathProgramCache]: Analyzing trace with hash 682587043, now seen corresponding path program 1 times [2018-08-08 14:10:23,011 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 14:10:23,011 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 236 with the following transitions: [2018-08-08 14:10:23,012 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], [211], [213], [216], [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 14:10:23,018 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-08-08 14:10:23,018 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 14:10:48,104 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 14:10:48,104 INFO L272 AbstractInterpreter]: Visited 119 different actions 467 times. Merged at 7 different actions 24 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-08-08 14:10:48,109 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 14:10:50,785 INFO L232 lantSequenceWeakener]: Weakened 233 states. On average, predicates are now at 77.81% of their original sizes. [2018-08-08 14:10:50,785 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 14:10:55,168 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 14:10:55,169 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 14:10:55,169 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-08-08 14:10:55,169 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 14:10:55,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-08-08 14:10:55,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-08-08 14:10:55,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-08-08 14:10:55,171 INFO L87 Difference]: Start difference. First operand 1035 states and 1256 transitions. Second operand 16 states. [2018-08-08 14:11:11,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 14:11:11,983 INFO L93 Difference]: Finished difference Result 2597 states and 3738 transitions. [2018-08-08 14:11:11,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-08-08 14:11:11,986 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 235 [2018-08-08 14:11:11,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 14:11:11,998 INFO L225 Difference]: With dead ends: 2597 [2018-08-08 14:11:11,998 INFO L226 Difference]: Without dead ends: 1936 [2018-08-08 14:11:12,003 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 252 GetRequests, 174 SyntacticMatches, 46 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=255, Invalid=867, Unknown=0, NotChecked=0, Total=1122 [2018-08-08 14:11:12,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2018-08-08 14:11:12,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1469. [2018-08-08 14:11:12,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2018-08-08 14:11:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 1742 transitions. [2018-08-08 14:11:12,059 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 1742 transitions. Word has length 235 [2018-08-08 14:11:12,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 14:11:12,060 INFO L480 AbstractCegarLoop]: Abstraction has 1469 states and 1742 transitions. [2018-08-08 14:11:12,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-08-08 14:11:12,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 1742 transitions. [2018-08-08 14:11:12,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-08-08 14:11:12,066 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 14:11:12,067 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 14:11:12,067 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 14:11:12,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1492949730, now seen corresponding path program 1 times [2018-08-08 14:11:12,068 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 14:11:12,068 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 261 with the following transitions: [2018-08-08 14:11:12,068 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], [211], [213], [216], [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 14:11:12,082 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-08-08 14:11:12,083 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 14:11:22,563 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-08-08 14:11:40,600 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 14:11:40,601 INFO L272 AbstractInterpreter]: Visited 119 different actions 580 times. Merged at 7 different actions 29 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-08-08 14:11:40,604 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 14:11:42,864 INFO L232 lantSequenceWeakener]: Weakened 258 states. On average, predicates are now at 77.76% of their original sizes. [2018-08-08 14:11:42,864 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 14:11:43,352 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 14:11:43,352 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 14:11:43,352 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-08-08 14:11:43,352 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 14:11:43,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-08-08 14:11:43,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-08-08 14:11:43,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-08-08 14:11:43,353 INFO L87 Difference]: Start difference. First operand 1469 states and 1742 transitions. Second operand 11 states. [2018-08-08 14:11:58,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 14:11:58,085 INFO L93 Difference]: Finished difference Result 2091 states and 2894 transitions. [2018-08-08 14:11:58,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-08-08 14:11:58,089 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 260 [2018-08-08 14:11:58,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 14:11:58,100 INFO L225 Difference]: With dead ends: 2091 [2018-08-08 14:11:58,100 INFO L226 Difference]: Without dead ends: 1846 [2018-08-08 14:11:58,102 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 270 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-08-08 14:11:58,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2018-08-08 14:11:58,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1839. [2018-08-08 14:11:58,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1839 states. [2018-08-08 14:11:58,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2176 transitions. [2018-08-08 14:11:58,171 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2176 transitions. Word has length 260 [2018-08-08 14:11:58,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 14:11:58,172 INFO L480 AbstractCegarLoop]: Abstraction has 1839 states and 2176 transitions. [2018-08-08 14:11:58,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-08-08 14:11:58,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2176 transitions. [2018-08-08 14:11:58,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-08-08 14:11:58,180 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 14:11:58,180 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 14:11:58,180 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 14:11:58,181 INFO L82 PathProgramCache]: Analyzing trace with hash 2054259501, now seen corresponding path program 1 times [2018-08-08 14:11:58,181 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 14:11:58,181 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 339 with the following transitions: [2018-08-08 14:11:58,181 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], [211], [213], [216], [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 14:11:58,185 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-08-08 14:11:58,186 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 14:12:07,742 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-08-08 14:12:32,393 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 14:12:32,393 INFO L272 AbstractInterpreter]: Visited 120 different actions 827 times. Merged at 8 different actions 53 times. Widened at 1 different actions 2 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-08-08 14:12:32,401 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 14:12:34,331 INFO L232 lantSequenceWeakener]: Weakened 336 states. On average, predicates are now at 77.68% of their original sizes. [2018-08-08 14:12:34,331 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 14:12:34,692 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 14:12:34,692 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 14:12:34,693 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-08-08 14:12:34,693 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 14:12:34,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-08-08 14:12:34,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-08-08 14:12:34,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-08-08 14:12:34,694 INFO L87 Difference]: Start difference. First operand 1839 states and 2176 transitions. Second operand 10 states. [2018-08-08 14:12:42,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 14:12:42,816 INFO L93 Difference]: Finished difference Result 2866 states and 3655 transitions. [2018-08-08 14:12:42,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-08-08 14:12:42,820 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 338 [2018-08-08 14:12:42,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 14:12:42,831 INFO L225 Difference]: With dead ends: 2866 [2018-08-08 14:12:42,831 INFO L226 Difference]: Without dead ends: 2251 [2018-08-08 14:12:42,834 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 345 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-08-08 14:12:42,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2251 states. [2018-08-08 14:12:42,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2251 to 2235. [2018-08-08 14:12:42,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2235 states. [2018-08-08 14:12:42,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 2656 transitions. [2018-08-08 14:12:42,916 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 2656 transitions. Word has length 338 [2018-08-08 14:12:42,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 14:12:42,917 INFO L480 AbstractCegarLoop]: Abstraction has 2235 states and 2656 transitions. [2018-08-08 14:12:42,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-08-08 14:12:42,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 2656 transitions. [2018-08-08 14:12:42,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-08-08 14:12:42,927 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 14:12:42,927 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-08-08 14:12:42,927 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__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 14:12:42,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1085792300, now seen corresponding path program 1 times [2018-08-08 14:12:42,928 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 14:12:42,928 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 364 with the following transitions: [2018-08-08 14:12:42,929 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], [211], [213], [216], [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], [624], [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 14:12:42,932 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-08-08 14:12:42,932 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 14:12:52,359 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-08-08 14:13:19,504 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 14:13:19,504 INFO L272 AbstractInterpreter]: Visited 120 different actions 829 times. Merged at 8 different actions 55 times. Widened at 1 different actions 2 times. Found 12 fixpoints after 2 different actions. Largest state had 24 variables. [2018-08-08 14:13:19,513 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 14:13:22,144 INFO L232 lantSequenceWeakener]: Weakened 361 states. On average, predicates are now at 77.65% of their original sizes. [2018-08-08 14:13:22,144 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 14:13:22,492 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 14:13:22,493 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 14:13:22,493 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-08-08 14:13:22,493 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 14:13:22,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-08-08 14:13:22,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-08-08 14:13:22,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-08-08 14:13:22,494 INFO L87 Difference]: Start difference. First operand 2235 states and 2656 transitions. Second operand 10 states. [2018-08-08 14:13:31,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 14:13:31,029 INFO L93 Difference]: Finished difference Result 3476 states and 4405 transitions. [2018-08-08 14:13:31,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-08-08 14:13:31,031 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 363 [2018-08-08 14:13:31,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 14:13:31,042 INFO L225 Difference]: With dead ends: 3476 [2018-08-08 14:13:31,043 INFO L226 Difference]: Without dead ends: 2467 [2018-08-08 14:13:31,047 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 370 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-08-08 14:13:31,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2018-08-08 14:13:31,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 2446. [2018-08-08 14:13:31,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2446 states. [2018-08-08 14:13:31,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 2920 transitions. [2018-08-08 14:13:31,137 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 2920 transitions. Word has length 363 [2018-08-08 14:13:31,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 14:13:31,138 INFO L480 AbstractCegarLoop]: Abstraction has 2446 states and 2920 transitions. [2018-08-08 14:13:31,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-08-08 14:13:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 2920 transitions. [2018-08-08 14:13:31,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-08-08 14:13:31,144 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 14:13:31,145 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-08-08 14:13:31,145 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__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 14:13:31,145 INFO L82 PathProgramCache]: Analyzing trace with hash 2010666237, now seen corresponding path program 1 times [2018-08-08 14:13:31,145 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 14:13:31,146 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 379 with the following transitions: [2018-08-08 14:13:31,146 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], [211], [213], [216], [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], [657], [661], [665], [669], [673], [677], [681], [684], [946], [947], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-08-08 14:13:31,150 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-08-08 14:13:31,150 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-08-08 14:13:38,052 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-08-08 14:13:38,053 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-08-08 14:13:38,054 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-08-08 14:13:38,100 WARN L205 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-08-08 14:13:38,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.08 02:13:38 BoogieIcfgContainer [2018-08-08 14:13:38,101 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-08-08 14:13:38,102 INFO L168 Benchmark]: Toolchain (without parser) took 259334.73 ms. Allocated memory was 1.5 GB in the beginning and 4.3 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-08-08 14:13:38,105 INFO L168 Benchmark]: CDTParser took 0.23 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 14:13:38,105 INFO L168 Benchmark]: CACSL2BoogieTranslator took 839.65 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: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. [2018-08-08 14:13:38,106 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.54 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 14:13:38,107 INFO L168 Benchmark]: Boogie Preprocessor took 307.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 806.4 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -907.8 MB). Peak memory consumption was 37.7 MB. Max. memory is 7.1 GB. [2018-08-08 14:13:38,107 INFO L168 Benchmark]: RCFGBuilder took 3946.46 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: 138.1 MB). Peak memory consumption was 138.1 MB. Max. memory is 7.1 GB. [2018-08-08 14:13:38,108 INFO L168 Benchmark]: TraceAbstraction took 254103.20 ms. Allocated memory was 2.3 GB in the beginning and 4.3 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -360.2 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-08-08 14:13:38,113 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.23 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 839.65 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: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 129.54 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 307.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 806.4 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -907.8 MB). Peak memory consumption was 37.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3946.46 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: 138.1 MB). Peak memory consumption was 138.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 254103.20 ms. Allocated memory was 2.3 GB in the beginning and 4.3 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -360.2 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 100]: 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 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 FALSE !((((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8))) [L454] COND FALSE !((((a15==9) && ((((a21==9) || (a21==10)) && (input == 4)) && ((-43 < a12) && (11 >= a12)) )) && (a24==1))) [L460] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 2))) [L467] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (((a21==9) || (a21==10)) && (input == 3))) && (a15==9)) && (a24==1))) [L472] COND FALSE !((((a15==8) && ( 80 < a12 && (((a21==8) || (a21==9)) && (input == 6)))) && (a24==1))) [L478] COND FALSE !((((((( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))) || ((a21==7) && ((-43 < a12) && (11 >= a12)) )) && (input == 3)) && (a24==1)) && (a15==9))) [L484] COND FALSE !(((a24==1) && ((input == 1) && (((a21==10) && ((a15==8) && 80 < a12 )) || (( a12 <= -43 && (a15==9)) && (a21==6)))))) [L490] COND TRUE (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 1)))) && (a15==8)) [L492] a21 = 9 [L494] RET return 21; [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 TRUE ((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10)) [L100] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. UNKNOWN Result, 254.0s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 77.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1610 SDtfs, 10282 SDslu, 1762 SDs, 0 SdLazy, 13548 SolverSat, 2594 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 68.5s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 1569 GetRequests, 1371 SyntacticMatches, 66 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 12.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2446occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 152.0s AbstIntTime, 8 AbstIntIterations, 7 AbstIntStrong, 0.9948388972805687 AbsIntWeakeningRatio, 0.11318242343541944 AbsIntAvgWeakeningVarsNumRemoved, 461.26631158455393 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 761 StatesRemovedByMinimization, 7 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_label23_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-08-08_14-13-38-127.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label23_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-08-08_14-13-38-127.csv Completed graceful shutdown