java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label10_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ddc4263 [2018-08-08 10:46:09,096 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-08-08 10:46:09,098 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-08-08 10:46:09,114 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-08-08 10:46:09,115 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-08-08 10:46:09,116 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-08-08 10:46:09,117 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-08-08 10:46:09,119 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-08-08 10:46:09,120 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-08-08 10:46:09,121 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-08-08 10:46:09,122 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-08-08 10:46:09,122 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-08-08 10:46:09,123 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-08-08 10:46:09,124 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-08-08 10:46:09,125 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-08-08 10:46:09,126 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-08-08 10:46:09,127 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-08-08 10:46:09,128 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-08-08 10:46:09,130 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-08-08 10:46:09,132 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-08-08 10:46:09,133 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-08-08 10:46:09,134 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-08-08 10:46:09,136 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-08-08 10:46:09,137 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-08-08 10:46:09,137 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-08-08 10:46:09,138 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-08-08 10:46:09,139 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-08-08 10:46:09,140 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-08-08 10:46:09,140 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-08-08 10:46:09,141 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-08-08 10:46:09,142 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-08-08 10:46:09,142 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-08-08 10:46:09,143 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-08-08 10:46:09,143 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-08-08 10:46:09,144 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-08-08 10:46:09,145 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-08-08 10:46:09,145 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf [2018-08-08 10:46:09,180 INFO L110 SettingsManager]: Loading preferences was successful [2018-08-08 10:46:09,181 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-08-08 10:46:09,184 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-08-08 10:46:09,184 INFO L133 SettingsManager]: * User list type=DISABLED [2018-08-08 10:46:09,184 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-08-08 10:46:09,184 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-08-08 10:46:09,185 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-08-08 10:46:09,185 INFO L133 SettingsManager]: * Octagon Domain=false [2018-08-08 10:46:09,185 INFO L133 SettingsManager]: * Abstract domain=CongruenceDomain [2018-08-08 10:46:09,185 INFO L133 SettingsManager]: * Log string format=TERM [2018-08-08 10:46:09,185 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-08-08 10:46:09,186 INFO L133 SettingsManager]: * Interval Domain=false [2018-08-08 10:46:09,187 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-08-08 10:46:09,187 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-08-08 10:46:09,187 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-08-08 10:46:09,187 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-08-08 10:46:09,188 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-08-08 10:46:09,188 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-08-08 10:46:09,188 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-08-08 10:46:09,188 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-08-08 10:46:09,188 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-08-08 10:46:09,189 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-08-08 10:46:09,189 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-08-08 10:46:09,189 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-08-08 10:46:09,189 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-08-08 10:46:09,189 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-08-08 10:46:09,190 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-08-08 10:46:09,190 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-08-08 10:46:09,190 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-08-08 10:46:09,190 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-08-08 10:46:09,191 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-08-08 10:46:09,191 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-08-08 10:46:09,191 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-08-08 10:46:09,191 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-08-08 10:46:09,260 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-08-08 10:46:09,278 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-08-08 10:46:09,284 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-08-08 10:46:09,286 INFO L271 PluginConnector]: Initializing CDTParser... [2018-08-08 10:46:09,287 INFO L276 PluginConnector]: CDTParser initialized [2018-08-08 10:46:09,287 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label10_true-unreach-call.c [2018-08-08 10:46:09,650 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13f25dbcd/527f62c0290648a3bd4c0fd3d8956acf/FLAG5f2700051 [2018-08-08 10:46:10,154 INFO L276 CDTParser]: Found 1 translation units. [2018-08-08 10:46:10,155 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label10_true-unreach-call.c [2018-08-08 10:46:10,198 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13f25dbcd/527f62c0290648a3bd4c0fd3d8956acf/FLAG5f2700051 [2018-08-08 10:46:10,220 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13f25dbcd/527f62c0290648a3bd4c0fd3d8956acf [2018-08-08 10:46:10,233 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-08-08 10:46:10,235 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-08-08 10:46:10,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-08-08 10:46:10,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-08-08 10:46:10,247 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-08-08 10:46:10,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.08 10:46:10" (1/1) ... [2018-08-08 10:46:10,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd82d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 10:46:10, skipping insertion in model container [2018-08-08 10:46:10,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.08 10:46:10" (1/1) ... [2018-08-08 10:46:10,651 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-08-08 10:46:11,973 INFO L175 PostProcessor]: Settings: Checked method=main [2018-08-08 10:46:11,993 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-08-08 10:46:12,778 INFO L175 PostProcessor]: Settings: Checked method=main [2018-08-08 10:46:13,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 10:46:13 WrapperNode [2018-08-08 10:46:13,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-08-08 10:46:13,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-08-08 10:46:13,205 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-08-08 10:46:13,205 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-08-08 10:46:13,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 10:46:13" (1/1) ... [2018-08-08 10:46:13,352 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 10:46:13" (1/1) ... [2018-08-08 10:46:13,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-08-08 10:46:13,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-08-08 10:46:13,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-08-08 10:46:13,533 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-08-08 10:46:14,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 10:46:13" (1/1) ... [2018-08-08 10:46:14,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 10:46:13" (1/1) ... [2018-08-08 10:46:14,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 10:46:13" (1/1) ... [2018-08-08 10:46:14,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 10:46:13" (1/1) ... [2018-08-08 10:46:14,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 10:46:13" (1/1) ... [2018-08-08 10:46:14,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 10:46:13" (1/1) ... [2018-08-08 10:46:14,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 10:46:13" (1/1) ... [2018-08-08 10:46:14,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-08-08 10:46:14,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-08-08 10:46:14,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-08-08 10:46:14,758 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-08-08 10:46:14,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 10:46:13" (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 10:46:14,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-08-08 10:46:14,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-08-08 10:46:14,832 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-08-08 10:46:14,833 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-08-08 10:46:14,833 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output3 [2018-08-08 10:46:14,833 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output3 [2018-08-08 10:46:14,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-08-08 10:46:14,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-08-08 10:46:14,834 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output4 [2018-08-08 10:46:14,834 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output4 [2018-08-08 10:46:14,834 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-08-08 10:46:14,834 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-08-08 10:46:14,834 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output2 [2018-08-08 10:46:14,834 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output2 [2018-08-08 10:46:29,010 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-08-08 10:46:29,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.08 10:46:29 BoogieIcfgContainer [2018-08-08 10:46:29,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-08-08 10:46:29,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-08-08 10:46:29,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-08-08 10:46:29,021 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-08-08 10:46:29,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.08 10:46:10" (1/3) ... [2018-08-08 10:46:29,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c15bceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.08 10:46:29, skipping insertion in model container [2018-08-08 10:46:29,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 10:46:13" (2/3) ... [2018-08-08 10:46:29,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c15bceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.08 10:46:29, skipping insertion in model container [2018-08-08 10:46:29,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.08 10:46:29" (3/3) ... [2018-08-08 10:46:29,025 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label10_true-unreach-call.c [2018-08-08 10:46:29,035 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-08-08 10:46:29,047 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-08-08 10:46:29,129 INFO L129 ementStrategyFactory]: Using default assertion order modulation [2018-08-08 10:46:29,130 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-08-08 10:46:29,131 INFO L382 AbstractCegarLoop]: Hoare is true [2018-08-08 10:46:29,131 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-08-08 10:46:29,131 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-08-08 10:46:29,131 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-08-08 10:46:29,131 INFO L386 AbstractCegarLoop]: Difference is false [2018-08-08 10:46:29,131 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-08-08 10:46:29,131 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-08-08 10:46:29,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-08-08 10:46:29,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-08-08 10:46:29,195 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 10:46:29,196 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-08-08 10:46:29,197 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 10:46:29,202 INFO L82 PathProgramCache]: Analyzing trace with hash 826381732, now seen corresponding path program 1 times [2018-08-08 10:46:29,205 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 10:46:29,206 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2018-08-08 10:46:29,209 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [3064], [3068], [3074], [3078], [4267], [4268], [4269], [4271] [2018-08-08 10:46:29,243 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-08-08 10:46:29,243 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 10:46:30,158 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 10:46:30,161 INFO L272 AbstractInterpreter]: Visited 53 different actions 53 times. Never merged. Never widened. Never found a fixpoint. Largest state had 25 variables. [2018-08-08 10:46:30,208 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 10:46:30,659 INFO L232 lantSequenceWeakener]: Weakened 51 states. On average, predicates are now at 72.97% of their original sizes. [2018-08-08 10:46:30,660 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 10:46:30,819 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 10:46:30,821 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 10:46:30,821 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-08-08 10:46:30,821 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 10:46:30,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-08-08 10:46:30,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-08-08 10:46:30,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-08-08 10:46:30,839 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 5 states. [2018-08-08 10:46:44,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 10:46:44,766 INFO L93 Difference]: Finished difference Result 3044 states and 5648 transitions. [2018-08-08 10:46:44,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-08-08 10:46:44,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-08-08 10:46:44,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 10:46:44,807 INFO L225 Difference]: With dead ends: 3044 [2018-08-08 10:46:44,807 INFO L226 Difference]: Without dead ends: 1922 [2018-08-08 10:46:44,821 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-08-08 10:46:44,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2018-08-08 10:46:44,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1920. [2018-08-08 10:46:44,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1920 states. [2018-08-08 10:46:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 2831 transitions. [2018-08-08 10:46:44,984 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 2831 transitions. Word has length 54 [2018-08-08 10:46:44,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 10:46:44,984 INFO L480 AbstractCegarLoop]: Abstraction has 1920 states and 2831 transitions. [2018-08-08 10:46:44,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-08-08 10:46:44,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 2831 transitions. [2018-08-08 10:46:44,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-08-08 10:46:44,993 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 10:46:44,994 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:46:44,994 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 10:46:44,994 INFO L82 PathProgramCache]: Analyzing trace with hash 17111254, now seen corresponding path program 1 times [2018-08-08 10:46:44,995 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 10:46:44,995 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2018-08-08 10:46:44,996 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [522], [526], [530], [534], [538], [542], [553], [557], [561], [565], [569], [573], [577], [581], [592], [596], [600], [604], [608], [612], [616], [620], [624], [628], [632], [636], [639], [1612], [3064], [3068], [3074], [3078], [3080], [4267], [4268], [4269], [4271], [4272] [2018-08-08 10:46:45,000 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-08-08 10:46:45,000 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 10:46:56,392 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 10:46:56,392 INFO L272 AbstractInterpreter]: Visited 108 different actions 210 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-08-08 10:46:56,430 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 10:47:01,830 INFO L232 lantSequenceWeakener]: Weakened 152 states. On average, predicates are now at 71.65% of their original sizes. [2018-08-08 10:47:01,831 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 10:47:02,056 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 10:47:02,056 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 10:47:02,056 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-08-08 10:47:02,056 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 10:47:02,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-08-08 10:47:02,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-08-08 10:47:02,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-08-08 10:47:02,059 INFO L87 Difference]: Start difference. First operand 1920 states and 2831 transitions. Second operand 9 states. [2018-08-08 10:47:25,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 10:47:25,815 INFO L93 Difference]: Finished difference Result 3839 states and 6442 transitions. [2018-08-08 10:47:25,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-08-08 10:47:25,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 155 [2018-08-08 10:47:25,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 10:47:25,837 INFO L225 Difference]: With dead ends: 3839 [2018-08-08 10:47:25,837 INFO L226 Difference]: Without dead ends: 2729 [2018-08-08 10:47:25,844 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 160 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-08-08 10:47:25,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2018-08-08 10:47:25,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 2726. [2018-08-08 10:47:25,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2726 states. [2018-08-08 10:47:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 3652 transitions. [2018-08-08 10:47:25,927 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 3652 transitions. Word has length 155 [2018-08-08 10:47:25,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 10:47:25,928 INFO L480 AbstractCegarLoop]: Abstraction has 2726 states and 3652 transitions. [2018-08-08 10:47:25,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-08-08 10:47:25,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 3652 transitions. [2018-08-08 10:47:25,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-08-08 10:47:25,934 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 10:47:25,934 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:25,935 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 10:47:25,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1185909407, now seen corresponding path program 1 times [2018-08-08 10:47:25,935 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 10:47:25,936 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-08-08 10:47:25,936 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [522], [526], [530], [534], [538], [542], [553], [557], [561], [565], [569], [573], [577], [581], [592], [596], [600], [604], [608], [612], [616], [620], [624], [628], [632], [636], [640], [644], [648], [652], [656], [660], [664], [668], [679], [683], [687], [691], [695], [699], [703], [707], [718], [729], [740], [744], [748], [752], [756], [760], [764], [768], [772], [776], [780], [783], [1612], [3064], [3068], [3074], [3078], [3080], [4267], [4268], [4269], [4271], [4272] [2018-08-08 10:47:25,940 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-08-08 10:47:25,940 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 10:47:42,610 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 10:47:42,610 INFO L272 AbstractInterpreter]: Visited 137 different actions 267 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-08-08 10:47:42,617 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 10:47:49,264 INFO L232 lantSequenceWeakener]: Weakened 181 states. On average, predicates are now at 71.57% of their original sizes. [2018-08-08 10:47:49,264 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 10:47:49,358 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 10:47:49,358 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 10:47:49,359 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-08-08 10:47:49,359 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 10:47:49,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-08-08 10:47:49,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-08-08 10:47:49,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-08-08 10:47:49,362 INFO L87 Difference]: Start difference. First operand 2726 states and 3652 transitions. Second operand 9 states. [2018-08-08 10:48:05,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 10:48:05,121 INFO L93 Difference]: Finished difference Result 4647 states and 7265 transitions. [2018-08-08 10:48:05,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-08-08 10:48:05,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 184 [2018-08-08 10:48:05,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 10:48:05,146 INFO L225 Difference]: With dead ends: 4647 [2018-08-08 10:48:05,146 INFO L226 Difference]: Without dead ends: 3537 [2018-08-08 10:48:05,152 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 189 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-08-08 10:48:05,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3537 states. [2018-08-08 10:48:05,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3537 to 3534. [2018-08-08 10:48:05,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3534 states. [2018-08-08 10:48:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3534 states to 3534 states and 4482 transitions. [2018-08-08 10:48:05,233 INFO L78 Accepts]: Start accepts. Automaton has 3534 states and 4482 transitions. Word has length 184 [2018-08-08 10:48:05,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 10:48:05,234 INFO L480 AbstractCegarLoop]: Abstraction has 3534 states and 4482 transitions. [2018-08-08 10:48:05,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-08-08 10:48:05,235 INFO L276 IsEmpty]: Start isEmpty. Operand 3534 states and 4482 transitions. [2018-08-08 10:48:05,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-08-08 10:48:05,241 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 10:48:05,241 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:05,242 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 10:48:05,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1821529002, now seen corresponding path program 1 times [2018-08-08 10:48:05,242 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 10:48:05,243 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 278 with the following transitions: [2018-08-08 10:48:05,243 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [522], [526], [530], [534], [538], [542], [553], [557], [561], [565], [569], [573], [577], [581], [592], [596], [600], [604], [608], [612], [616], [620], [624], [628], [632], [636], [640], [644], [648], [652], [656], [660], [664], [668], [679], [683], [687], [691], [695], [699], [703], [707], [718], [729], [740], [744], [748], [752], [756], [760], [764], [768], [772], [776], [780], [784], [788], [799], [803], [814], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [872], [876], [880], [891], [895], [899], [903], [907], [911], [915], [919], [930], [934], [938], [942], [946], [950], [954], [965], [969], [973], [977], [988], [992], [996], [1000], [1004], [1008], [1012], [1016], [1020], [1024], [1028], [1032], [1036], [1040], [1044], [1048], [1052], [1056], [1060], [1064], [1068], [1072], [1083], [1087], [1091], [1095], [1099], [1103], [1107], [1111], [1115], [1119], [1123], [1127], [1131], [1142], [1146], [1150], [1154], [1158], [1162], [1166], [1170], [1174], [1178], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1236], [1239], [1612], [3064], [3068], [3074], [3078], [3080], [4267], [4268], [4269], [4271], [4272] [2018-08-08 10:48:05,249 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-08-08 10:48:05,249 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 10:48:36,514 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 10:48:36,514 INFO L272 AbstractInterpreter]: Visited 230 different actions 453 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-08-08 10:48:36,525 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 10:48:46,347 INFO L232 lantSequenceWeakener]: Weakened 274 states. On average, predicates are now at 71.32% of their original sizes. [2018-08-08 10:48:46,347 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 10:48:46,435 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 10:48:46,435 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 10:48:46,435 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-08-08 10:48:46,435 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 10:48:46,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-08-08 10:48:46,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-08-08 10:48:46,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-08-08 10:48:46,437 INFO L87 Difference]: Start difference. First operand 3534 states and 4482 transitions. Second operand 9 states. [2018-08-08 10:49:04,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 10:49:04,095 INFO L93 Difference]: Finished difference Result 5738 states and 8650 transitions. [2018-08-08 10:49:04,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-08-08 10:49:04,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 277 [2018-08-08 10:49:04,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 10:49:04,119 INFO L225 Difference]: With dead ends: 5738 [2018-08-08 10:49:04,120 INFO L226 Difference]: Without dead ends: 4628 [2018-08-08 10:49:04,125 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 283 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-08-08 10:49:04,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4628 states. [2018-08-08 10:49:04,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4628 to 4616. [2018-08-08 10:49:04,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4616 states. [2018-08-08 10:49:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4616 states to 4616 states and 5632 transitions. [2018-08-08 10:49:04,237 INFO L78 Accepts]: Start accepts. Automaton has 4616 states and 5632 transitions. Word has length 277 [2018-08-08 10:49:04,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 10:49:04,239 INFO L480 AbstractCegarLoop]: Abstraction has 4616 states and 5632 transitions. [2018-08-08 10:49:04,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-08-08 10:49:04,239 INFO L276 IsEmpty]: Start isEmpty. Operand 4616 states and 5632 transitions. [2018-08-08 10:49:04,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-08-08 10:49:04,245 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 10:49:04,245 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-08-08 10:49:04,246 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 10:49:04,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1763615545, now seen corresponding path program 1 times [2018-08-08 10:49:04,246 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 10:49:04,246 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 286 with the following transitions: [2018-08-08 10:49:04,247 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [522], [526], [530], [534], [538], [542], [553], [557], [561], [565], [569], [573], [577], [581], [592], [596], [600], [604], [608], [612], [616], [620], [624], [628], [632], [636], [639], [640], [644], [648], [652], [656], [660], [664], [668], [679], [683], [687], [691], [695], [699], [703], [707], [718], [729], [740], [744], [748], [752], [756], [760], [764], [768], [772], [776], [780], [783], [1612], [3064], [3068], [3074], [3078], [3080], [4267], [4268], [4269], [4271], [4272] [2018-08-08 10:49:04,249 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-08-08 10:49:04,249 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 10:49:27,140 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-08-08 10:49:27,141 INFO L272 AbstractInterpreter]: Visited 139 different actions 812 times. Merged at 7 different actions 36 times. Never widened. Found 7 fixpoints after 1 different actions. Largest state had 26 variables. [2018-08-08 10:49:27,149 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-08-08 10:49:27,191 WARN L205 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-08-08 10:49:27,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.08 10:49:27 BoogieIcfgContainer [2018-08-08 10:49:27,191 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-08-08 10:49:27,192 INFO L168 Benchmark]: Toolchain (without parser) took 196958.73 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -490.1 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-08-08 10:49:27,194 INFO L168 Benchmark]: CDTParser took 0.69 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 10:49:27,195 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2968.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 328.7 MB). Peak memory consumption was 328.7 MB. Max. memory is 7.1 GB. [2018-08-08 10:49:27,196 INFO L168 Benchmark]: Boogie Procedure Inliner took 327.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-08-08 10:49:27,197 INFO L168 Benchmark]: Boogie Preprocessor took 1225.32 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 993.5 MB). Free memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 174.4 MB. Max. memory is 7.1 GB. [2018-08-08 10:49:27,198 INFO L168 Benchmark]: RCFGBuilder took 14253.22 ms. Allocated memory was 2.5 GB in the beginning and 2.7 GB in the end (delta: 158.3 MB). Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 86.9 MB). Peak memory consumption was 747.0 MB. Max. memory is 7.1 GB. [2018-08-08 10:49:27,199 INFO L168 Benchmark]: TraceAbstraction took 178179.43 ms. Allocated memory was 2.7 GB in the beginning and 4.2 GB in the end (delta: 1.5 GB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 355.7 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-08-08 10:49:27,204 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.69 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 2968.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 328.7 MB). Peak memory consumption was 328.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 327.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 1225.32 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 993.5 MB). Free memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 174.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 14253.22 ms. Allocated memory was 2.5 GB in the beginning and 2.7 GB in the end (delta: 158.3 MB). Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 86.9 MB). Peak memory consumption was 747.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 178179.43 ms. Allocated memory was 2.7 GB in the beginning and 4.2 GB in the end (delta: 1.5 GB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 355.7 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 153]: 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: [L10] int inputB = 2; [L11] int inputE = 5; [L12] int inputC = 3; [L13] int inputD = 4; [L14] int inputF = 6; [L17] int a26 = 1; [L18] int a13 = 0; [L19] int a19 = 9; [L20] int a23 = 158; [L21] int a12 = 286; [L22] int a1 = 2; [L5803] int output = -1; [L5806] COND TRUE 1 [L5809] int input; [L5810] input = __VERIFIER_nondet_int() [L5811] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L5814] CALL, EXPR calculate_output(input) [L29] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L32] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L35] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L38] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L41] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L44] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L47] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L50] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L53] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L56] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L59] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L62] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L65] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L68] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L71] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L74] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L77] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L80] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L83] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L86] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L89] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L92] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L95] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L98] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L101] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L104] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L107] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L110] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L113] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L116] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L119] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L122] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L125] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L128] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L131] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L134] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L137] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L140] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L143] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L146] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L149] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L152] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L155] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L158] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L161] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L164] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L167] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L170] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L173] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L176] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L179] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L182] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L185] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L188] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L191] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L194] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L197] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L200] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L203] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L206] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L209] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L213] COND FALSE !(((a26==1) && (((((input == 5) && ((( ((264 < a23) && (476 >= a23)) && (a19==10)) || ( 476 < a23 && (a19==10))) || ( a23 <= 95 && (a19==11)))) && ((178 < a12) && (395 >= a12)) ) && (a1==3)) && (a13==1)))) [L221] COND FALSE !(((a19==13) && ( ((395 < a12) && (441 >= a12)) && ((a1==3) && ((a26==1) && (((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a13==1))))))) [L229] COND FALSE !(((((a1==2) && (((input == 2) && (((a19==12) && a23 <= 95 ) || (((a19==11) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==11))))) && !(a13==1))) && 441 < a12 ) && (a26==1))) [L236] COND FALSE !((((a26==1) && (((a13==1) && ((input == 2) && (( a23 <= 95 && (a19==13)) || (((a19==12) && ((264 < a23) && (476 >= a23)) ) || ((a19==12) && 476 < a23 ))))) && a12 <= 178 )) && (a1==3))) [L243] COND FALSE !(((((a26==1) && (((a19==11) && ((a1==2) && (input == 6))) && 441 < a12 )) && (a13==1)) && ((95 < a23) && (264 >= a23)) )) [L251] COND FALSE !(( a12 <= 178 && (!(a13==1) && ((a26==1) && (((input == 2) && (((a19==13) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==12)) || ((a19==12) && 476 < a23 )))) && (a1==3)))))) [L262] COND FALSE !((((((a1==2) && (((( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 )) || ( ((95 < a23) && (264 >= a23)) && (a19==11))) && (input == 3))) && ((395 < a12) && (441 >= a12)) ) && (a26==1)) && !(a13==1))) [L269] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a26==1) && (((a19==9) && (((input == 6) && (a13==1)) && (a1==3))) && 476 < a23 )))) [L275] COND FALSE !((( ((95 < a23) && (264 >= a23)) && ((!(a13==1) && ((a19==11) && ((a26==1) && (input == 4)))) && ((178 < a12) && (395 >= a12)) )) && (a1==2))) [L279] COND FALSE !(((a26==1) && (((((a19==13) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6))) && a12 <= 178 ) && !(a13==1)) && (a1==3)))) [L285] COND FALSE !(((((a26==1) && (( 441 < a12 && (!(a13==1) && (input == 2))) && ((95 < a23) && (264 >= a23)) )) && (a1==3)) && (a19==13))) [L292] COND FALSE !(((a19==13) && ((((a1==3) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)) && 441 < a12 )) && (a26==1)) && !(a13==1)))) [L308] COND FALSE !(((a19==11) && ((a26==1) && (( 476 < a23 && ( ((395 < a12) && (441 >= a12)) && ((a1==3) && (input == 2)))) && !(a13==1))))) [L315] COND FALSE !(((a1==3) && ((a26==1) && ((((a19==13) && ((input == 3) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) ))) && ((178 < a12) && (395 >= a12)) ) && !(a13==1))))) [L321] COND FALSE !(((a26==1) && (((((((a19==11) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 ))) && (input == 6)) && !(a13==1)) && ((395 < a12) && (441 >= a12)) ) && (a1==3)))) [L327] COND FALSE !((((a19==10) && (((((input == 2) && ((178 < a12) && (395 >= a12)) ) && a23 <= 95 ) && (a13==1)) && (a1==3))) && (a26==1))) [L330] COND FALSE !(((((a1==2) && (((a26==1) && ((input == 2) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 ))) && 441 < a12 )) && (a13==1)) && (a19==13))) [L337] COND FALSE !(((((((a1==2) && (!(a13==1) && (input == 6))) && (a19==12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && ((178 < a12) && (395 >= a12)) )) [L342] COND FALSE !(((a26==1) && (((( ((395 < a12) && (441 >= a12)) && ((input == 5) && (a19==11))) && (a13==1)) && (a1==3)) && ((264 < a23) && (476 >= a23)) ))) [L350] COND FALSE !(((a13==1) && ((( 441 < a12 && ((input == 6) && ((( 476 < a23 && (a19==9)) || ( a23 <= 95 && (a19==10))) || ( ((95 < a23) && (264 >= a23)) && (a19==10))))) && (a26==1)) && (a1==2)))) [L365] COND FALSE !(( ((264 < a23) && (476 >= a23)) && ((a26==1) && ((!(a13==1) && ((a1==3) && ((input == 3) && (a19==10)))) && a12 <= 178 )))) [L372] COND FALSE !(((((a1==3) && ((((( ((264 < a23) && (476 >= a23)) && (a19==13)) && (a13==1)) || ((a13==1) && ( 476 < a23 && (a19==13)))) || (((a19==9) && a23 <= 95 ) && !(a13==1))) && (input == 2))) && ((395 < a12) && (441 >= a12)) ) && (a26==1))) [L379] COND FALSE !(((a19==13) && (((a13==1) && ((a1==2) && ((a26==1) && (( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (input == 5))))) && ((395 < a12) && (441 >= a12)) ))) [L387] COND FALSE !(((a26==1) && (((((a19==13) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4))) && (a13==1)) && (a1==3)) && ((178 < a12) && (395 >= a12)) ))) [L393] COND FALSE !((!(a13==1) && ((a26==1) && (( ((178 < a12) && (395 >= a12)) && ((((a19==10) && ((95 < a23) && (264 >= a23)) ) || (((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10)))) && (input == 3))) && (a1==2))))) [L398] COND FALSE !((( 441 < a12 && ((a1==3) && ((a19==12) && (((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a13==1))))) && (a26==1))) [L404] COND FALSE !(((a13==1) && ((( ((395 < a12) && (441 >= a12)) && (((( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))) || ((a19==10) && a23 <= 95 )) && (input == 5))) && (a26==1)) && (a1==2)))) [L411] COND FALSE !((((a1==3) && ((a19==9) && ( ((395 < a12) && (441 >= a12)) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 5)) && !(a13==1))))) && (a26==1))) [L417] COND FALSE !((( ((395 < a12) && (441 >= a12)) && ((a19==11) && ((a13==1) && (((input == 5) && (a1==3)) && 476 < a23 )))) && (a26==1))) [L423] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((!(a13==1) && (((((a19==12) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==12))) || ( a23 <= 95 && (a19==13))) && (input == 4))) && (a1==2)) && (a26==1)))) [L430] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a26==1) && ((a1==2) && (!(a13==1) && ((a19==10) && ((input == 2) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )))))))) [L436] COND FALSE !(((a26==1) && ((((((input == 6) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && !(a13==1)) && (a19==9)) && (a1==2)) && ((178 < a12) && (395 >= a12)) ))) [L441] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((a1==2) && ((a26==1) && ((input == 4) && ((( 476 < a23 && (a19==10)) || ( a23 <= 95 && (a19==11))) || ( ((95 < a23) && (264 >= a23)) && (a19==11)))))) && !(a13==1)))) [L448] COND FALSE !(((a26==1) && (((((a1==2) && ((input == 2) && ((395 < a12) && (441 >= a12)) )) && (a19==13)) && !(a13==1)) && ((95 < a23) && (264 >= a23)) ))) [L455] COND FALSE !(( 441 < a12 && ((a13==1) && ((a26==1) && (( ((95 < a23) && (264 >= a23)) && ((input == 2) && (a19==11))) && (a1==2)))))) [L462] COND FALSE !(((((((a13==1) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 6))) && (a1==2)) && (a19==9)) && 441 < a12 ) && (a26==1))) [L469] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a19==10) && ( ((264 < a23) && (476 >= a23)) && (((!(a13==1) && (input == 3)) && (a26==1)) && (a1==2)))))) [L476] COND FALSE !((((a1==3) && ( ((178 < a12) && (395 >= a12)) && ((a13==1) && ((a19==12) && ((input == 4) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )))))) && (a26==1))) [L480] COND FALSE !(((a19==11) && ((!(a13==1) && ((a26==1) && (((input == 2) && ((178 < a12) && (395 >= a12)) ) && (a1==2)))) && a23 <= 95 ))) [L487] COND FALSE !((((a13==1) && (((a26==1) && ((((a19==11) && 476 < a23 ) || ( a23 <= 95 && (a19==12))) && (input == 3))) && a12 <= 178 )) && (a1==4))) [L499] COND FALSE !((((a1==3) && ((a13==1) && ((((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) || ((264 < a23) && (476 >= a23)) ) && (input == 6)) && (a26==1)) && (a19==9)))) && ((178 < a12) && (395 >= a12)) )) [L505] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((((a19==11) && ((input == 6) && (a26==1))) && (a1==3)) && (a13==1)) && ((264 < a23) && (476 >= a23)) ))) [L511] COND FALSE !((( a12 <= 178 && (!(a13==1) && (((input == 6) && (((a19==10) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==9)) || ((a19==9) && 476 < a23 )))) && (a26==1)))) && (a1==4))) [L517] COND FALSE !(((a1==3) && (!(a13==1) && ((((((a19==11) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==10)) || ( a23 <= 95 && (a19==11)))) && (input == 3)) && ((395 < a12) && (441 >= a12)) ) && (a26==1))))) [L524] COND FALSE !(((((a26==1) && ((a1==2) && ((input == 3) && ((((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10))) || ( ((95 < a23) && (264 >= a23)) && (a19==10)))))) && (a13==1)) && 441 < a12 )) [L530] COND FALSE !(( 476 < a23 && ((a26==1) && ( ((178 < a12) && (395 >= a12)) && ((a13==1) && ((a1==3) && ((a19==9) && (input == 2)))))))) [L536] COND FALSE !(((( ((178 < a12) && (395 >= a12)) && ((a26==1) && ((input == 4) && ((( 476 < a23 && (a19==12)) || ((a19==13) && a23 <= 95 )) || ((a19==13) && ((95 < a23) && (264 >= a23)) ))))) && !(a13==1)) && (a1==2))) [L543] COND FALSE !(((((a26==1) && (!(a13==1) && ((( 476 < a23 && (a19==9)) || ((a19==10) && a23 <= 95 )) && (input == 2)))) && a12 <= 178 ) && (a1==3))) [L555] COND FALSE !(((a26==1) && (((((a19==12) && ((input == 4) && ((264 < a23) && (476 >= a23)) )) && 441 < a12 ) && !(a13==1)) && (a1==3)))) [L569] COND FALSE !((((input == 3) && ((!(a13==1) && ((a19==13) && ((a1==2) && ( 441 < a12 && 476 < a23 )))) || (((( a23 <= 95 && a12 <= 178 ) && (a1==3)) && (a19==9)) && (a13==1)))) && (a26==1))) [L585] COND FALSE !(((a26==1) && ( ((395 < a12) && (441 >= a12)) && (!(a13==1) && (((a1==3) && ((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a19==13)))))) [L593] COND FALSE !((( a12 <= 178 && ((((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4)) && (a19==10)) && (a26==1)) && (a13==1))) && (a1==3))) [L596] COND FALSE !((((((a19==11) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 3)) && (a13==1))) && (a1==4)) && a12 <= 178 ) && (a26==1))) [L604] COND FALSE !((( a12 <= 178 && ((a1==3) && (((input == 5) && (((a19==12) && ((95 < a23) && (264 >= a23)) ) || (((a19==11) && 476 < a23 ) || ( a23 <= 95 && (a19==12))))) && (a26==1)))) && (a13==1))) [L610] COND FALSE !(((a19==11) && ( ((264 < a23) && (476 >= a23)) && ( ((395 < a12) && (441 >= a12)) && (((a26==1) && (!(a13==1) && (input == 3))) && (a1==3)))))) [L617] COND FALSE !(((((a19==13) && (( 476 < a23 && ((a13==1) && (input == 2))) && a12 <= 178 )) && (a1==3)) && (a26==1))) [L624] COND FALSE !(( 441 < a12 && (( a23 <= 95 && ((((a13==1) && (input == 4)) && (a26==1)) && (a19==11))) && (a1==3)))) [L630] COND FALSE !(((!(a13==1) && ((a26==1) && ((a1==3) && ((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 5)) && ((178 < a12) && (395 >= a12)) )))) && (a19==13))) [L636] COND FALSE !((((a26==1) && ((input == 5) && (((( ((395 < a12) && (441 >= a12)) && 476 < a23 ) && (a19==13)) && !(a13==1)) || ((( a23 <= 95 && 441 < a12 ) && (a19==9)) && (a13==1))))) && (a1==2))) [L644] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((a1==3) && (((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6)) && (a26==1)) && !(a13==1))) && (a19==9)))) [L647] COND TRUE ((((a1==2) && (!(a13==1) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 4)) && ((178 < a12) && (395 >= a12)) ))) && (a19==9)) && (a26==1)) [L648] a12 = (((a12 / -5) + 328769) - 513772) [L649] a23 = (((a23 + -228281) - 322230) + -30284) [L650] a13 = 1 [L652] RET return -1; [L5814] EXPR calculate_output(input) [L5814] output = calculate_output(input) [L5806] COND TRUE 1 [L5809] int input; [L5810] input = __VERIFIER_nondet_int() [L5811] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L5814] CALL, EXPR calculate_output(input) [L29] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L32] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L35] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L38] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L41] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L44] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L47] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L50] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L53] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L56] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L59] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L62] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L65] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L68] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L71] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L74] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L77] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L80] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L83] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L86] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L89] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L92] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L95] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L98] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L101] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L104] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L107] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L110] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L113] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L116] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L119] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L122] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L125] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L128] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L131] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L134] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L137] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L140] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L143] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L146] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L149] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L152] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L155] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L158] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L161] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L164] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L167] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L170] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L173] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L176] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L179] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L182] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L185] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L188] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L191] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L194] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L197] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L200] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L203] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L206] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L209] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L213] COND FALSE !(((a26==1) && (((((input == 5) && ((( ((264 < a23) && (476 >= a23)) && (a19==10)) || ( 476 < a23 && (a19==10))) || ( a23 <= 95 && (a19==11)))) && ((178 < a12) && (395 >= a12)) ) && (a1==3)) && (a13==1)))) [L221] COND FALSE !(((a19==13) && ( ((395 < a12) && (441 >= a12)) && ((a1==3) && ((a26==1) && (((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a13==1))))))) [L229] COND FALSE !(((((a1==2) && (((input == 2) && (((a19==12) && a23 <= 95 ) || (((a19==11) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==11))))) && !(a13==1))) && 441 < a12 ) && (a26==1))) [L236] COND FALSE !((((a26==1) && (((a13==1) && ((input == 2) && (( a23 <= 95 && (a19==13)) || (((a19==12) && ((264 < a23) && (476 >= a23)) ) || ((a19==12) && 476 < a23 ))))) && a12 <= 178 )) && (a1==3))) [L243] COND FALSE !(((((a26==1) && (((a19==11) && ((a1==2) && (input == 6))) && 441 < a12 )) && (a13==1)) && ((95 < a23) && (264 >= a23)) )) [L251] COND FALSE !(( a12 <= 178 && (!(a13==1) && ((a26==1) && (((input == 2) && (((a19==13) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==12)) || ((a19==12) && 476 < a23 )))) && (a1==3)))))) [L262] COND FALSE !((((((a1==2) && (((( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 )) || ( ((95 < a23) && (264 >= a23)) && (a19==11))) && (input == 3))) && ((395 < a12) && (441 >= a12)) ) && (a26==1)) && !(a13==1))) [L269] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a26==1) && (((a19==9) && (((input == 6) && (a13==1)) && (a1==3))) && 476 < a23 )))) [L275] COND FALSE !((( ((95 < a23) && (264 >= a23)) && ((!(a13==1) && ((a19==11) && ((a26==1) && (input == 4)))) && ((178 < a12) && (395 >= a12)) )) && (a1==2))) [L279] COND FALSE !(((a26==1) && (((((a19==13) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6))) && a12 <= 178 ) && !(a13==1)) && (a1==3)))) [L285] COND FALSE !(((((a26==1) && (( 441 < a12 && (!(a13==1) && (input == 2))) && ((95 < a23) && (264 >= a23)) )) && (a1==3)) && (a19==13))) [L292] COND FALSE !(((a19==13) && ((((a1==3) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)) && 441 < a12 )) && (a26==1)) && !(a13==1)))) [L308] COND FALSE !(((a19==11) && ((a26==1) && (( 476 < a23 && ( ((395 < a12) && (441 >= a12)) && ((a1==3) && (input == 2)))) && !(a13==1))))) [L315] COND FALSE !(((a1==3) && ((a26==1) && ((((a19==13) && ((input == 3) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) ))) && ((178 < a12) && (395 >= a12)) ) && !(a13==1))))) [L321] COND FALSE !(((a26==1) && (((((((a19==11) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 ))) && (input == 6)) && !(a13==1)) && ((395 < a12) && (441 >= a12)) ) && (a1==3)))) [L327] COND FALSE !((((a19==10) && (((((input == 2) && ((178 < a12) && (395 >= a12)) ) && a23 <= 95 ) && (a13==1)) && (a1==3))) && (a26==1))) [L330] COND FALSE !(((((a1==2) && (((a26==1) && ((input == 2) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 ))) && 441 < a12 )) && (a13==1)) && (a19==13))) [L337] COND FALSE !(((((((a1==2) && (!(a13==1) && (input == 6))) && (a19==12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && ((178 < a12) && (395 >= a12)) )) [L342] COND FALSE !(((a26==1) && (((( ((395 < a12) && (441 >= a12)) && ((input == 5) && (a19==11))) && (a13==1)) && (a1==3)) && ((264 < a23) && (476 >= a23)) ))) [L350] COND FALSE !(((a13==1) && ((( 441 < a12 && ((input == 6) && ((( 476 < a23 && (a19==9)) || ( a23 <= 95 && (a19==10))) || ( ((95 < a23) && (264 >= a23)) && (a19==10))))) && (a26==1)) && (a1==2)))) [L365] COND FALSE !(( ((264 < a23) && (476 >= a23)) && ((a26==1) && ((!(a13==1) && ((a1==3) && ((input == 3) && (a19==10)))) && a12 <= 178 )))) [L372] COND FALSE !(((((a1==3) && ((((( ((264 < a23) && (476 >= a23)) && (a19==13)) && (a13==1)) || ((a13==1) && ( 476 < a23 && (a19==13)))) || (((a19==9) && a23 <= 95 ) && !(a13==1))) && (input == 2))) && ((395 < a12) && (441 >= a12)) ) && (a26==1))) [L379] COND FALSE !(((a19==13) && (((a13==1) && ((a1==2) && ((a26==1) && (( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (input == 5))))) && ((395 < a12) && (441 >= a12)) ))) [L387] COND FALSE !(((a26==1) && (((((a19==13) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4))) && (a13==1)) && (a1==3)) && ((178 < a12) && (395 >= a12)) ))) [L393] COND FALSE !((!(a13==1) && ((a26==1) && (( ((178 < a12) && (395 >= a12)) && ((((a19==10) && ((95 < a23) && (264 >= a23)) ) || (((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10)))) && (input == 3))) && (a1==2))))) [L398] COND FALSE !((( 441 < a12 && ((a1==3) && ((a19==12) && (((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a13==1))))) && (a26==1))) [L404] COND FALSE !(((a13==1) && ((( ((395 < a12) && (441 >= a12)) && (((( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))) || ((a19==10) && a23 <= 95 )) && (input == 5))) && (a26==1)) && (a1==2)))) [L411] COND FALSE !((((a1==3) && ((a19==9) && ( ((395 < a12) && (441 >= a12)) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 5)) && !(a13==1))))) && (a26==1))) [L417] COND FALSE !((( ((395 < a12) && (441 >= a12)) && ((a19==11) && ((a13==1) && (((input == 5) && (a1==3)) && 476 < a23 )))) && (a26==1))) [L423] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((!(a13==1) && (((((a19==12) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==12))) || ( a23 <= 95 && (a19==13))) && (input == 4))) && (a1==2)) && (a26==1)))) [L430] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a26==1) && ((a1==2) && (!(a13==1) && ((a19==10) && ((input == 2) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )))))))) [L436] COND TRUE ((a26==1) && ((((((input == 6) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && !(a13==1)) && (a19==9)) && (a1==2)) && ((178 < a12) && (395 >= a12)) )) [L437] a23 = (((a23 + 74530) * 5) * 1) [L438] a19 = 10 [L440] RET return 22; [L5814] EXPR calculate_output(input) [L5814] output = calculate_output(input) [L5806] COND TRUE 1 [L5809] int input; [L5810] input = __VERIFIER_nondet_int() [L5811] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L5814] CALL calculate_output(input) [L29] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L32] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L35] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L38] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L41] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L44] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L47] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L50] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L53] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L56] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L59] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L62] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L65] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L68] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L71] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L74] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L77] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L80] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L83] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L86] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L89] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L92] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L95] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L98] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L101] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L104] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L107] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L110] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L113] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L116] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L119] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L122] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L125] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L128] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L131] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L134] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L137] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L140] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L143] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L146] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L149] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L152] COND TRUE ((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1)) [L153] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 1120 locations, 1 error locations. UNKNOWN Result, 178.0s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 71.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4952 SDtfs, 8373 SDslu, 2780 SDs, 0 SdLazy, 35564 SolverSat, 3435 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 62.2s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 685 GetRequests, 642 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4616occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 83.3s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.9978333669638018 AbsIntWeakeningRatio, 0.11711711711711711 AbsIntAvgWeakeningVarsNumRemoved, 1.6546546546546546 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 4 MinimizatonAttempts, 20 StatesRemovedByMinimization, 4 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/Problem13_label10_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-08-08_10-49-27-221.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem13_label10_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-08-08_10-49-27-221.csv Received shutdown request...