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/Problem12_label49_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-11 19:04:28,257 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-11 19:04:28,259 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-11 19:04:28,276 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-11 19:04:28,276 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-11 19:04:28,277 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-11 19:04:28,279 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-11 19:04:28,281 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-11 19:04:28,282 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-11 19:04:28,283 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-11 19:04:28,284 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-11 19:04:28,285 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-11 19:04:28,286 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-11 19:04:28,287 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-11 19:04:28,288 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-11 19:04:28,289 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-11 19:04:28,290 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-11 19:04:28,292 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-11 19:04:28,294 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-11 19:04:28,295 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-11 19:04:28,296 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-11 19:04:28,298 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-11 19:04:28,300 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-11 19:04:28,300 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-11 19:04:28,301 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-11 19:04:28,301 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-11 19:04:28,306 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-11 19:04:28,307 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-11 19:04:28,310 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-11 19:04:28,311 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-11 19:04:28,311 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-11 19:04:28,312 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-11 19:04:28,312 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-11 19:04:28,313 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-11 19:04:28,318 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-11 19:04:28,319 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-11 19:04:28,319 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf [2018-09-11 19:04:28,350 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-11 19:04:28,350 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-11 19:04:28,351 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-11 19:04:28,351 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-11 19:04:28,351 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-11 19:04:28,354 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-11 19:04:28,354 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-11 19:04:28,355 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-11 19:04:28,355 INFO L133 SettingsManager]: * Abstract domain=CongruenceDomain [2018-09-11 19:04:28,355 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-11 19:04:28,355 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-11 19:04:28,355 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-11 19:04:28,356 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-11 19:04:28,356 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-11 19:04:28,357 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-11 19:04:28,357 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-11 19:04:28,357 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-11 19:04:28,357 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-11 19:04:28,358 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-11 19:04:28,359 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-11 19:04:28,359 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-11 19:04:28,359 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-11 19:04:28,359 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-11 19:04:28,359 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-11 19:04:28,360 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-11 19:04:28,360 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-11 19:04:28,360 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-11 19:04:28,360 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-11 19:04:28,360 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-11 19:04:28,361 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-11 19:04:28,361 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-11 19:04:28,361 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-11 19:04:28,361 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-11 19:04:28,362 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-11 19:04:28,413 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-11 19:04:28,433 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-11 19:04:28,441 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-11 19:04:28,442 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-11 19:04:28,443 INFO L276 PluginConnector]: CDTParser initialized [2018-09-11 19:04:28,444 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label49_true-unreach-call.c [2018-09-11 19:04:28,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21ad04a31/3f920f36842d4c09ba95a50ae28a5565/FLAGbfa9d8f72 [2018-09-11 19:04:29,223 INFO L276 CDTParser]: Found 1 translation units. [2018-09-11 19:04:29,224 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label49_true-unreach-call.c [2018-09-11 19:04:29,255 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21ad04a31/3f920f36842d4c09ba95a50ae28a5565/FLAGbfa9d8f72 [2018-09-11 19:04:29,271 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21ad04a31/3f920f36842d4c09ba95a50ae28a5565 [2018-09-11 19:04:29,285 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-11 19:04:29,289 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-11 19:04:29,294 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-11 19:04:29,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-11 19:04:29,301 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-11 19:04:29,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:04:29" (1/1) ... [2018-09-11 19:04:29,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66a95c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:04:29, skipping insertion in model container [2018-09-11 19:04:29,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:04:29" (1/1) ... [2018-09-11 19:04:29,660 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-11 19:04:30,700 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-11 19:04:30,722 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-11 19:04:31,407 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-11 19:04:31,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:04:31 WrapperNode [2018-09-11 19:04:31,640 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-11 19:04:31,641 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-11 19:04:31,641 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-11 19:04:31,641 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-11 19:04:31,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:04:31" (1/1) ... [2018-09-11 19:04:31,753 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:04:31" (1/1) ... [2018-09-11 19:04:31,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-11 19:04:31,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-11 19:04:31,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-11 19:04:31,913 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-11 19:04:32,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:04:31" (1/1) ... [2018-09-11 19:04:32,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:04:31" (1/1) ... [2018-09-11 19:04:32,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:04:31" (1/1) ... [2018-09-11 19:04:32,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:04:31" (1/1) ... [2018-09-11 19:04:32,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:04:31" (1/1) ... [2018-09-11 19:04:32,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:04:31" (1/1) ... [2018-09-11 19:04:32,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:04:31" (1/1) ... [2018-09-11 19:04:32,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-11 19:04:32,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-11 19:04:32,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-11 19:04:32,837 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-11 19:04:32,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:04:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-11 19:04:32,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-11 19:04:32,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-11 19:04:32,913 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-11 19:04:32,913 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-11 19:04:32,913 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-09-11 19:04:32,913 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-09-11 19:04:32,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-11 19:04:32,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-11 19:04:32,914 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-09-11 19:04:32,914 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-09-11 19:04:32,914 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-11 19:04:32,914 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-11 19:04:32,915 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-09-11 19:04:32,915 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-09-11 19:04:42,707 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-11 19:04:42,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:04:42 BoogieIcfgContainer [2018-09-11 19:04:42,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-11 19:04:42,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-11 19:04:42,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-11 19:04:42,712 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-11 19:04:42,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:04:29" (1/3) ... [2018-09-11 19:04:42,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b236222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:04:42, skipping insertion in model container [2018-09-11 19:04:42,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:04:31" (2/3) ... [2018-09-11 19:04:42,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b236222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:04:42, skipping insertion in model container [2018-09-11 19:04:42,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:04:42" (3/3) ... [2018-09-11 19:04:42,716 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label49_true-unreach-call.c [2018-09-11 19:04:42,726 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-11 19:04:42,736 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-11 19:04:42,798 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-11 19:04:42,799 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-11 19:04:42,799 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-11 19:04:42,799 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-11 19:04:42,799 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-11 19:04:42,799 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-11 19:04:42,800 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-11 19:04:42,800 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-11 19:04:42,800 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-11 19:04:42,844 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-09-11 19:04:42,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-11 19:04:42,858 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 19:04:42,860 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] [2018-09-11 19:04:42,861 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 19:04:42,867 INFO L82 PathProgramCache]: Analyzing trace with hash -517362759, now seen corresponding path program 1 times [2018-09-11 19:04:42,870 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 19:04:42,870 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-09-11 19:04:42,873 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], [293], [295], [2360], [2364], [2370], [2374], [3269], [3270], [3271], [3273] [2018-09-11 19:04:42,902 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 19:04:42,902 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 19:04:43,109 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 19:04:43,111 INFO L272 AbstractInterpreter]: Visited 48 different actions 48 times. Never merged. Never widened. Never found a fixpoint. Largest state had 25 variables. [2018-09-11 19:04:43,139 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 19:04:43,275 INFO L232 lantSequenceWeakener]: Weakened 46 states. On average, predicates are now at 77.26% of their original sizes. [2018-09-11 19:04:43,275 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 19:04:43,467 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 19:04:43,469 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 19:04:43,469 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-11 19:04:43,470 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 19:04:43,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-11 19:04:43,482 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-11 19:04:43,483 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-11 19:04:43,486 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 5 states. [2018-09-11 19:04:59,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 19:04:59,323 INFO L93 Difference]: Finished difference Result 2448 states and 4699 transitions. [2018-09-11 19:04:59,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-11 19:04:59,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-09-11 19:04:59,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 19:04:59,368 INFO L225 Difference]: With dead ends: 2448 [2018-09-11 19:04:59,368 INFO L226 Difference]: Without dead ends: 1606 [2018-09-11 19:04:59,381 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-11 19:04:59,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2018-09-11 19:04:59,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1604. [2018-09-11 19:04:59,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-09-11 19:04:59,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2357 transitions. [2018-09-11 19:04:59,544 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2357 transitions. Word has length 49 [2018-09-11 19:04:59,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 19:04:59,547 INFO L480 AbstractCegarLoop]: Abstraction has 1604 states and 2357 transitions. [2018-09-11 19:04:59,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-11 19:04:59,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2357 transitions. [2018-09-11 19:04:59,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-09-11 19:04:59,558 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 19:04:59,559 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-11 19:04:59,559 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 19:04:59,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1324602090, now seen corresponding path program 1 times [2018-09-11 19:04:59,560 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 19:04:59,560 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2018-09-11 19:04:59,561 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], [293], [295], [298], [306], [314], [322], [330], [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], [515], [518], [1374], [2360], [2364], [2370], [2374], [2376], [3269], [3270], [3271], [3273], [3274] [2018-09-11 19:04:59,566 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 19:04:59,566 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 19:04:59,845 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 19:04:59,846 INFO L272 AbstractInterpreter]: Visited 83 different actions 159 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-11 19:04:59,873 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 19:05:00,237 INFO L232 lantSequenceWeakener]: Weakened 122 states. On average, predicates are now at 75.98% of their original sizes. [2018-09-11 19:05:00,238 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 19:05:00,876 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 19:05:00,876 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 19:05:00,876 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 19:05:00,877 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 19:05:00,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 19:05:00,879 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 19:05:00,879 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 19:05:00,880 INFO L87 Difference]: Start difference. First operand 1604 states and 2357 transitions. Second operand 9 states. [2018-09-11 19:05:20,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 19:05:20,133 INFO L93 Difference]: Finished difference Result 3976 states and 6980 transitions. [2018-09-11 19:05:20,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-11 19:05:20,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 125 [2018-09-11 19:05:20,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 19:05:20,149 INFO L225 Difference]: With dead ends: 3976 [2018-09-11 19:05:20,149 INFO L226 Difference]: Without dead ends: 3146 [2018-09-11 19:05:20,154 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 130 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-09-11 19:05:20,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3146 states. [2018-09-11 19:05:20,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3146 to 3143. [2018-09-11 19:05:20,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2018-09-11 19:05:20,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 3918 transitions. [2018-09-11 19:05:20,234 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 3918 transitions. Word has length 125 [2018-09-11 19:05:20,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 19:05:20,235 INFO L480 AbstractCegarLoop]: Abstraction has 3143 states and 3918 transitions. [2018-09-11 19:05:20,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 19:05:20,235 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 3918 transitions. [2018-09-11 19:05:20,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-11 19:05:20,241 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 19:05:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-11 19:05:20,241 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 19:05:20,242 INFO L82 PathProgramCache]: Analyzing trace with hash -500307262, now seen corresponding path program 1 times [2018-09-11 19:05:20,242 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 19:05:20,242 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-09-11 19:05:20,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], [293], [295], [298], [306], [314], [322], [330], [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], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [798], [1374], [2360], [2364], [2370], [2374], [2376], [3269], [3270], [3271], [3273], [3274] [2018-09-11 19:05:20,250 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 19:05:20,250 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 19:05:21,006 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 19:05:21,006 INFO L272 AbstractInterpreter]: Visited 153 different actions 300 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-11 19:05:21,043 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 19:05:21,643 INFO L232 lantSequenceWeakener]: Weakened 192 states. On average, predicates are now at 75.67% of their original sizes. [2018-09-11 19:05:21,643 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 19:05:21,795 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 19:05:21,796 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 19:05:21,796 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 19:05:21,796 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 19:05:21,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 19:05:21,798 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 19:05:21,798 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 19:05:21,798 INFO L87 Difference]: Start difference. First operand 3143 states and 3918 transitions. Second operand 9 states. [2018-09-11 19:05:33,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 19:05:33,868 INFO L93 Difference]: Finished difference Result 4746 states and 7019 transitions. [2018-09-11 19:05:33,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-11 19:05:33,874 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2018-09-11 19:05:33,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 19:05:33,891 INFO L225 Difference]: With dead ends: 4746 [2018-09-11 19:05:33,891 INFO L226 Difference]: Without dead ends: 3916 [2018-09-11 19:05:33,895 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 200 GetRequests, 187 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-09-11 19:05:33,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3916 states. [2018-09-11 19:05:33,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3916 to 3913. [2018-09-11 19:05:33,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3913 states. [2018-09-11 19:05:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 4717 transitions. [2018-09-11 19:05:33,984 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 4717 transitions. Word has length 195 [2018-09-11 19:05:33,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 19:05:33,985 INFO L480 AbstractCegarLoop]: Abstraction has 3913 states and 4717 transitions. [2018-09-11 19:05:33,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 19:05:33,985 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 4717 transitions. [2018-09-11 19:05:33,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-09-11 19:05:33,990 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 19:05:33,991 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-11 19:05:33,991 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 19:05:33,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1870093430, now seen corresponding path program 1 times [2018-09-11 19:05:33,992 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 19:05:33,992 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-09-11 19:05:33,993 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], [293], [295], [298], [306], [314], [322], [330], [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], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [814], [1374], [2360], [2364], [2370], [2374], [2376], [3269], [3270], [3271], [3273], [3274] [2018-09-11 19:05:33,996 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 19:05:33,996 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 19:05:34,701 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 19:05:34,702 INFO L272 AbstractInterpreter]: Visited 157 different actions 308 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-11 19:05:34,738 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 19:05:35,414 INFO L232 lantSequenceWeakener]: Weakened 196 states. On average, predicates are now at 75.66% of their original sizes. [2018-09-11 19:05:35,414 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 19:05:35,541 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 19:05:35,542 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 19:05:35,542 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-11 19:05:35,542 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 19:05:35,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-11 19:05:35,543 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-11 19:05:35,543 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-11 19:05:35,543 INFO L87 Difference]: Start difference. First operand 3913 states and 4717 transitions. Second operand 9 states. [2018-09-11 19:05:47,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 19:05:47,987 INFO L93 Difference]: Finished difference Result 5517 states and 7820 transitions. [2018-09-11 19:05:47,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-11 19:05:47,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 199 [2018-09-11 19:05:47,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 19:05:48,008 INFO L225 Difference]: With dead ends: 5517 [2018-09-11 19:05:48,008 INFO L226 Difference]: Without dead ends: 4687 [2018-09-11 19:05:48,012 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 204 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-09-11 19:05:48,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2018-09-11 19:05:48,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4682. [2018-09-11 19:05:48,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4682 states. [2018-09-11 19:05:48,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4682 states to 4682 states and 5516 transitions. [2018-09-11 19:05:48,118 INFO L78 Accepts]: Start accepts. Automaton has 4682 states and 5516 transitions. Word has length 199 [2018-09-11 19:05:48,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 19:05:48,119 INFO L480 AbstractCegarLoop]: Abstraction has 4682 states and 5516 transitions. [2018-09-11 19:05:48,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-11 19:05:48,120 INFO L276 IsEmpty]: Start isEmpty. Operand 4682 states and 5516 transitions. [2018-09-11 19:05:48,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-09-11 19:05:48,125 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 19:05:48,125 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-11 19:05:48,126 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 19:05:48,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1008262879, now seen corresponding path program 1 times [2018-09-11 19:05:48,126 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 19:05:48,127 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 272 with the following transitions: [2018-09-11 19:05:48,127 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], [293], [295], [298], [306], [314], [322], [330], [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], [515], [518], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [798], [1374], [2360], [2364], [2370], [2374], [2376], [3269], [3270], [3271], [3273], [3274] [2018-09-11 19:05:48,135 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-11 19:05:48,135 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 19:05:49,422 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-11 19:05:49,422 INFO L272 AbstractInterpreter]: Visited 155 different actions 608 times. Merged at 7 different actions 23 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 26 variables. [2018-09-11 19:05:49,430 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-11 19:05:49,468 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-11 19:05:49,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 07:05:49 BoogieIcfgContainer [2018-09-11 19:05:49,469 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-11 19:05:49,470 INFO L168 Benchmark]: Toolchain (without parser) took 80183.52 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-09-11 19:05:49,471 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-11 19:05:49,472 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2346.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-09-11 19:05:49,473 INFO L168 Benchmark]: Boogie Procedure Inliner took 271.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-11 19:05:49,474 INFO L168 Benchmark]: Boogie Preprocessor took 924.14 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 935.3 MB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 127.9 MB. Max. memory is 7.1 GB. [2018-09-11 19:05:49,475 INFO L168 Benchmark]: RCFGBuilder took 9871.16 ms. Allocated memory was 2.5 GB in the beginning and 2.6 GB in the end (delta: 154.7 MB). Free memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: -140.8 MB). Peak memory consumption was 749.9 MB. Max. memory is 7.1 GB. [2018-09-11 19:05:49,476 INFO L168 Benchmark]: TraceAbstraction took 66759.98 ms. Allocated memory was 2.6 GB in the beginning and 3.3 GB in the end (delta: 659.6 MB). Free memory was 2.5 GB in the beginning and 2.8 GB in the end (delta: -347.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-09-11 19:05:49,481 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2346.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 271.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 924.14 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 935.3 MB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 127.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9871.16 ms. Allocated memory was 2.5 GB in the beginning and 2.6 GB in the end (delta: 154.7 MB). Free memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: -140.8 MB). Peak memory consumption was 749.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 66759.98 ms. Allocated memory was 2.6 GB in the beginning and 3.3 GB in the end (delta: 659.6 MB). Free memory was 2.5 GB in the beginning and 2.8 GB in the end (delta: -347.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 138]: 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 inputC = 3; [L11] int inputF = 6; [L12] int inputA = 1; [L13] int inputB = 2; [L14] int inputD = 4; [L15] int inputE = 5; [L18] int a17 = -124; [L19] int a5 = 4; [L20] int a24 = 15; [L21] int a2 = 170; [L22] int a7 = 13; [L4815] int output = -1; [L4818] COND TRUE 1 [L4821] int input; [L4822] input = __VERIFIER_nondet_int() [L4823] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L4826] CALL, EXPR calculate_output(input) [L29] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==3))) [L32] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==4))) [L35] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==4))) [L38] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==4))) [L41] COND FALSE !((((((a7==13) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==4))) [L44] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==4))) [L47] COND FALSE !((((((a7==12) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==3))) [L50] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==4))) [L53] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==3))) [L56] COND FALSE !((((((a7==13) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==3))) [L59] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==15)) && (a5==3))) [L62] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==15)) && (a5==3))) [L65] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==4))) [L68] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==3))) [L71] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==15)) && (a5==3))) [L74] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==4))) [L77] COND FALSE !((((((a7==13) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==3))) [L80] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==3))) [L83] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==4))) [L86] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==15)) && (a5==3))) [L89] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==4))) [L92] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==3))) [L95] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==3))) [L98] COND FALSE !((((((a7==12) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==3))) [L101] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==4))) [L104] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==15)) && (a5==3))) [L107] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==4))) [L110] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==4))) [L113] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==4))) [L116] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==15)) && (a5==3))) [L119] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==3))) [L122] COND FALSE !((((((a7==13) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==4))) [L125] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==4))) [L128] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==3))) [L131] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==3))) [L134] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==4))) [L137] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==4))) [L140] COND FALSE !((((((a7==12) && a2 <= 189 ) && 255 < a17 ) && (a24==15)) && (a5==3))) [L143] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==15)) && (a5==4))) [L146] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==15)) && (a5==3))) [L149] COND FALSE !((((((a7==13) && a2 <= 189 ) && a17 <= -108 ) && (a24==15)) && (a5==3))) [L152] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==3))) [L155] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==3))) [L158] COND FALSE !((((((a7==13) && a2 <= 189 ) && 255 < a17 ) && (a24==15)) && (a5==3))) [L161] COND FALSE !((((((a7==12) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==4))) [L164] COND FALSE !((((((a7==13) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==4))) [L167] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==4))) [L170] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==3))) [L173] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==3))) [L176] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==15)) && (a5==3))) [L179] COND FALSE !((((((a7==12) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==4))) [L182] COND FALSE !((((((a7==13) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==4))) [L185] COND FALSE !((((((a7==13) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==3))) [L188] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==3))) [L191] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==3))) [L194] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==4))) [L197] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==3))) [L200] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==15)) && (a5==3))) [L203] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==3))) [L206] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==3))) [L209] COND FALSE !((((((a7==13) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==3))) [L213] COND FALSE !(((( ((189 < a2) && (281 >= a2)) && ((input == 4) && (((a7==12) && 255 < a17 ) || (((a7==13) && ((111 < a17) && (255 >= a17)) ) || ( ((111 < a17) && (255 >= a17)) && (a7==14)))))) && (a5==4)) && (a24==14))) [L218] COND FALSE !(((((a24==13) && (((input == 2) && ((a7==13) || (a7==14))) && (a5==3))) && a17 <= -108 ) && ((189 < a2) && (281 >= a2)) )) [L223] COND FALSE !((((((((a7==12) && ((111 < a17) && (255 >= a17)) ) || (( ((-108 < a17) && (111 >= a17)) && (a7==13)) || ( ((-108 < a17) && (111 >= a17)) && (a7==14)))) && (input == 1)) && (a24==14)) && ((189 < a2) && (281 >= a2)) ) && (a5==5))) [L230] COND FALSE !(((( ((189 < a2) && (281 >= a2)) && (((( a17 <= -108 && (a7==13)) || ( a17 <= -108 && (a7==14))) || ( ((-108 < a17) && (111 >= a17)) && (a7==12))) && (input == 4))) && (a5==3)) && (a24==14))) [L237] COND FALSE !(((a5==6) && (((a24==13) && ((input == 6) && ((((a7==13) && ((111 < a17) && (255 >= a17)) ) || ((a7==14) && ((111 < a17) && (255 >= a17)) )) || ( 255 < a17 && (a7==12))))) && a2 <= 189 ))) [L245] COND FALSE !((((a24==13) && ( ((189 < a2) && (281 >= a2)) && (((((a7==13) && ((111 < a17) && (255 >= a17)) ) || ( ((111 < a17) && (255 >= a17)) && (a7==14))) || ( 255 < a17 && (a7==12))) && (input == 3)))) && (a5==6))) [L250] COND TRUE ((a5==4) && ( a2 <= 189 && ((((input == 1) && ((a7==13) || (a7==14))) && a17 <= -108 ) && (a24==15)))) [L252] a7 = 12 [L253] a24 = 13 [L254] a5 = 3 [L256] RET return -1; [L4826] EXPR calculate_output(input) [L4826] output = calculate_output(input) [L4818] COND TRUE 1 [L4821] int input; [L4822] input = __VERIFIER_nondet_int() [L4823] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L4826] CALL, EXPR calculate_output(input) [L29] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==3))) [L32] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==4))) [L35] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==4))) [L38] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==4))) [L41] COND FALSE !((((((a7==13) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==4))) [L44] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==4))) [L47] COND FALSE !((((((a7==12) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==3))) [L50] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==4))) [L53] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==3))) [L56] COND FALSE !((((((a7==13) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==3))) [L59] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==15)) && (a5==3))) [L62] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==15)) && (a5==3))) [L65] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==4))) [L68] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==3))) [L71] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==15)) && (a5==3))) [L74] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==4))) [L77] COND FALSE !((((((a7==13) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==3))) [L80] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==3))) [L83] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==4))) [L86] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==15)) && (a5==3))) [L89] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==4))) [L92] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==3))) [L95] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==3))) [L98] COND FALSE !((((((a7==12) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==3))) [L101] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==4))) [L104] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==15)) && (a5==3))) [L107] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==4))) [L110] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==4))) [L113] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==4))) [L116] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==15)) && (a5==3))) [L119] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==3))) [L122] COND FALSE !((((((a7==13) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==4))) [L125] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==4))) [L128] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==3))) [L131] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==3))) [L134] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==4))) [L137] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==4))) [L140] COND FALSE !((((((a7==12) && a2 <= 189 ) && 255 < a17 ) && (a24==15)) && (a5==3))) [L143] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==15)) && (a5==4))) [L146] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==15)) && (a5==3))) [L149] COND FALSE !((((((a7==13) && a2 <= 189 ) && a17 <= -108 ) && (a24==15)) && (a5==3))) [L152] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==3))) [L155] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==3))) [L158] COND FALSE !((((((a7==13) && a2 <= 189 ) && 255 < a17 ) && (a24==15)) && (a5==3))) [L161] COND FALSE !((((((a7==12) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==4))) [L164] COND FALSE !((((((a7==13) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==4))) [L167] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==4))) [L170] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==3))) [L173] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==3))) [L176] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==15)) && (a5==3))) [L179] COND FALSE !((((((a7==12) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==4))) [L182] COND FALSE !((((((a7==13) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==4))) [L185] COND FALSE !((((((a7==13) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==3))) [L188] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==3))) [L191] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==3))) [L194] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==4))) [L197] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==3))) [L200] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==15)) && (a5==3))) [L203] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==3))) [L206] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==3))) [L209] COND FALSE !((((((a7==13) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==3))) [L213] COND FALSE !(((( ((189 < a2) && (281 >= a2)) && ((input == 4) && (((a7==12) && 255 < a17 ) || (((a7==13) && ((111 < a17) && (255 >= a17)) ) || ( ((111 < a17) && (255 >= a17)) && (a7==14)))))) && (a5==4)) && (a24==14))) [L218] COND FALSE !(((((a24==13) && (((input == 2) && ((a7==13) || (a7==14))) && (a5==3))) && a17 <= -108 ) && ((189 < a2) && (281 >= a2)) )) [L223] COND FALSE !((((((((a7==12) && ((111 < a17) && (255 >= a17)) ) || (( ((-108 < a17) && (111 >= a17)) && (a7==13)) || ( ((-108 < a17) && (111 >= a17)) && (a7==14)))) && (input == 1)) && (a24==14)) && ((189 < a2) && (281 >= a2)) ) && (a5==5))) [L230] COND FALSE !(((( ((189 < a2) && (281 >= a2)) && (((( a17 <= -108 && (a7==13)) || ( a17 <= -108 && (a7==14))) || ( ((-108 < a17) && (111 >= a17)) && (a7==12))) && (input == 4))) && (a5==3)) && (a24==14))) [L237] COND FALSE !(((a5==6) && (((a24==13) && ((input == 6) && ((((a7==13) && ((111 < a17) && (255 >= a17)) ) || ((a7==14) && ((111 < a17) && (255 >= a17)) )) || ( 255 < a17 && (a7==12))))) && a2 <= 189 ))) [L245] COND FALSE !((((a24==13) && ( ((189 < a2) && (281 >= a2)) && (((((a7==13) && ((111 < a17) && (255 >= a17)) ) || ( ((111 < a17) && (255 >= a17)) && (a7==14))) || ( 255 < a17 && (a7==12))) && (input == 3)))) && (a5==6))) [L250] COND FALSE !(((a5==4) && ( a2 <= 189 && ((((input == 1) && ((a7==13) || (a7==14))) && a17 <= -108 ) && (a24==15))))) [L257] COND FALSE !(((a24==15) && ((( ((189 < a2) && (281 >= a2)) && ((input == 1) && (a5==4))) && (a7==13)) && 255 < a17 ))) [L264] COND FALSE !(((a5==4) && ( ((189 < a2) && (281 >= a2)) && ((a24==14) && ((( ((-108 < a17) && (111 >= a17)) && (a7==14)) || ((a7==12) && ((111 < a17) && (255 >= a17)) )) && (input == 4)))))) [L272] COND FALSE !(((((a5==5) && ( a2 <= 189 && ((input == 1) && (a24==15)))) && 255 < a17 ) && (a7==14))) [L278] COND FALSE !((( a17 <= -108 && ( ((189 < a2) && (281 >= a2)) && ((((a7==14) || ((a7==12) || (a7==13))) && (input == 1)) && (a24==15)))) && (a5==5))) [L284] COND FALSE !((( a17 <= -108 && (( ((189 < a2) && (281 >= a2)) && (((a7==12) || (a7==13)) && (input == 5))) && (a24==13))) && (a5==6))) [L291] COND FALSE !((((a24==13) && ( a17 <= -108 && (((a5==4) && (input == 2)) && ((189 < a2) && (281 >= a2)) ))) && (a7==12))) [L298] COND FALSE !((((a5==3) && ( ((-108 < a17) && (111 >= a17)) && ((a24==13) && (((a7==12) || (a7==13)) && (input == 4))))) && ((189 < a2) && (281 >= a2)) )) [L303] COND FALSE !(( ((111 < a17) && (255 >= a17)) && ((a5==4) && ( a2 <= 189 && ((a24==15) && (((a7==13) || (a7==14)) && (input == 5))))))) [L309] COND FALSE !(( a2 <= 189 && ((((( ((-108 < a17) && (111 >= a17)) && (a7==14)) || ( ((111 < a17) && (255 >= a17)) && (a7==12))) && (input == 6)) && (a5==7)) && (a24==13)))) [L316] COND FALSE !(((((((a24==13) && ( a17 <= -108 && (a7==13))) && (a5==5)) || (((a5==4) && ((a24==15) && ((a7==14) && 255 < a17 ))) || ((a5==5) && ((a24==13) && ((a7==12) && a17 <= -108 ))))) && (input == 1)) && ((189 < a2) && (281 >= a2)) )) [L323] COND FALSE !(((((a24==13) && ((((a7==13) || (a7==14)) && (input == 5)) && ((189 < a2) && (281 >= a2)) )) && (a5==3)) && a17 <= -108 )) [L330] COND FALSE !((((a5==4) && ((((input == 5) && ((a7==12) || (a7==13))) && (a24==14)) && ((189 < a2) && (281 >= a2)) )) && a17 <= -108 )) [L337] COND FALSE !(((a24==14) && ((a5==3) && (((( ((-108 < a17) && (111 >= a17)) && (a7==12)) || (( a17 <= -108 && (a7==13)) || ((a7==14) && a17 <= -108 ))) && (input == 2)) && ((189 < a2) && (281 >= a2)) )))) [L345] COND FALSE !(((((a5==4) && (((input == 1) && (a24==15)) && ((-108 < a17) && (111 >= a17)) )) && a2 <= 189 ) && (a7==12))) [L351] COND FALSE !(( a2 <= 189 && (((a5==4) && (((input == 2) && (a24==15)) && (a7==12))) && ((-108 < a17) && (111 >= a17)) ))) [L358] COND FALSE !(((a24==13) && ( ((-108 < a17) && (111 >= a17)) && ((a5==5) && (((input == 2) && a2 <= 189 ) && (a7==14)))))) [L365] COND FALSE !(( a2 <= 189 && ((((a5==5) && ((input == 3) && (a24==13))) && (a7==14)) && ((111 < a17) && (255 >= a17)) ))) [L371] COND FALSE !(((((((a5==5) && (input == 1)) && ((189 < a2) && (281 >= a2)) ) && (a24==13)) && (a7==13)) && ((-108 < a17) && (111 >= a17)) )) [L378] COND FALSE !((( ((189 < a2) && (281 >= a2)) && (((input == 6) && ((( ((-108 < a17) && (111 >= a17)) && (a7==14)) || ((a7==12) && ((111 < a17) && (255 >= a17)) )) || ((a7==13) && ((111 < a17) && (255 >= a17)) ))) && (a24==15))) && (a5==3))) [L384] COND FALSE !((((a5==7) && ((( ((-108 < a17) && (111 >= a17)) && (input == 1)) && (a7==13)) && a2 <= 189 )) && (a24==14))) [L391] COND FALSE !(( ((189 < a2) && (281 >= a2)) && ((a24==15) && ((a5==5) && ( ((111 < a17) && (255 >= a17)) && (((a7==14) || ((a7==12) || (a7==13))) && (input == 6))))))) [L397] COND FALSE !((( a2 <= 189 && (( 255 < a17 && ((input == 3) && ((a7==13) || (a7==14)))) && (a5==7))) && (a24==15))) [L404] COND FALSE !((( ((189 < a2) && (281 >= a2)) && ((a24==13) && ( ((-108 < a17) && (111 >= a17)) && ((input == 4) && ((a7==12) || (a7==13)))))) && (a5==6))) [L409] COND FALSE !(( a17 <= -108 && (((((input == 5) && ((a7==12) || (a7==13))) && (a5==5)) && ((189 < a2) && (281 >= a2)) ) && (a24==14)))) [L417] COND FALSE !(( a2 <= 189 && ((a5==5) && ((input == 6) && (((a24==14) && ((a7==13) && a17 <= -108 )) || (((a24==13) && ( 255 < a17 && (a7==14))) || ((a24==14) && ((a7==12) && a17 <= -108 )))))))) [L424] COND FALSE !((((a5==6) && ((a24==13) && (((((a7==13) && ((111 < a17) && (255 >= a17)) ) || ((a7==14) && ((111 < a17) && (255 >= a17)) )) || ((a7==12) && 255 < a17 )) && (input == 1)))) && a2 <= 189 )) [L430] COND FALSE !((((a5==7) && ((((((a7==14) && a17 <= -108 ) || ((a7==12) && ((-108 < a17) && (111 >= a17)) )) || ( ((-108 < a17) && (111 >= a17)) && (a7==13))) && (input == 4)) && a2 <= 189 )) && (a24==13))) [L438] COND FALSE !(( a2 <= 189 && ((a24==15) && ((((input == 6) && ((a7==13) || (a7==14))) && (a5==4)) && ((-108 < a17) && (111 >= a17)) )))) [L445] COND FALSE !((( ((189 < a2) && (281 >= a2)) && ((((( a17 <= -108 && (a7==13)) || ( a17 <= -108 && (a7==14))) || ( ((-108 < a17) && (111 >= a17)) && (a7==12))) && (input == 3)) && (a5==3))) && (a24==14))) [L452] COND FALSE !((((a24==13) && (((( ((111 < a17) && (255 >= a17)) && (a7==14)) || ( 255 < a17 && (a7==12))) && (input == 2)) && (a5==4))) && ((189 < a2) && (281 >= a2)) )) [L459] COND FALSE !(((( ((111 < a17) && (255 >= a17)) && (((a5==5) && (input == 4)) && a2 <= 189 )) && (a7==14)) && (a24==15))) [L466] COND FALSE !(((((((a7==12) && (input == 6)) && ((189 < a2) && (281 >= a2)) ) && (a5==4)) && (a24==13)) && a17 <= -108 )) [L469] COND FALSE !(((a24==15) && ((a5==6) && ((((a7==12) && (input == 6)) && a17 <= -108 ) && a2 <= 189 )))) [L475] COND FALSE !((( ((111 < a17) && (255 >= a17)) && ((a24==15) && ((a5==6) && ((a7==12) && (input == 6))))) && a2 <= 189 )) [L481] COND FALSE !((((((a24==14) && ((input == 4) && ((a7==12) || (a7==13)))) && a17 <= -108 ) && ((189 < a2) && (281 >= a2)) ) && (a5==5))) [L488] COND FALSE !(((a24==13) && (( ((111 < a17) && (255 >= a17)) && (((input == 6) && ((a7==12) || (a7==13))) && (a5==4))) && ((189 < a2) && (281 >= a2)) ))) [L495] COND FALSE !((((a24==15) && ( a2 <= 189 && ((((a7==12) || (a7==13)) && (input == 6)) && (a5==5)))) && 255 < a17 )) [L502] COND FALSE !((((a7==12) && ((a24==15) && ((a5==6) && ((input == 2) && a2 <= 189 )))) && a17 <= -108 )) [L510] COND FALSE !(((a5==6) && ((((a7==12) && ((input == 3) && (a24==13))) && a2 <= 189 ) && a17 <= -108 ))) [L517] COND FALSE !(( a2 <= 189 && ( ((111 < a17) && (255 >= a17)) && ((((a24==15) && (input == 6)) && (a5==4)) && (a7==12))))) [L524] COND FALSE !((((a5==6) && (((input == 2) && (( 255 < a17 && (a7==12)) || (( ((111 < a17) && (255 >= a17)) && (a7==13)) || ((a7==14) && ((111 < a17) && (255 >= a17)) )))) && (a24==13))) && ((189 < a2) && (281 >= a2)) )) [L531] COND FALSE !((((a24==15) && ((a5==4) && ((((a7==12) || (a7==13)) && (input == 6)) && a2 <= 189 ))) && 255 < a17 )) [L537] COND FALSE !((((( ((189 < a2) && (281 >= a2)) && ((input == 6) && (a5==4))) && (a24==15)) && ((-108 < a17) && (111 >= a17)) ) && (a7==13))) [L543] COND FALSE !(( ((-108 < a17) && (111 >= a17)) && (((a24==13) && ((a5==4) && (((a7==13) || (a7==14)) && (input == 5)))) && ((189 < a2) && (281 >= a2)) ))) [L550] COND FALSE !(( a17 <= -108 && ((a24==14) && (( a2 <= 189 && ((input == 3) && ((a7==13) || (a7==14)))) && (a5==6))))) [L557] COND FALSE !(( a2 <= 189 && (((a5==4) && ( 255 < a17 && (((a7==12) || (a7==13)) && (input == 1)))) && (a24==15)))) [L564] COND FALSE !(((a5==7) && (((a24==14) && ((input == 2) && (( ((-108 < a17) && (111 >= a17)) && (a7==12)) || (( a17 <= -108 && (a7==13)) || ( a17 <= -108 && (a7==14)))))) && a2 <= 189 ))) [L571] COND FALSE !(((a24==14) && (((a7==13) && ( ((189 < a2) && (281 >= a2)) && ((input == 2) && ((-108 < a17) && (111 >= a17)) ))) && (a5==4)))) [L577] COND FALSE !(((((a5==5) && (((((a7==14) && a17 <= -108 ) || ((a7==12) && ((-108 < a17) && (111 >= a17)) )) || ((a7==13) && ((-108 < a17) && (111 >= a17)) )) && (input == 6))) && (a24==13)) && a2 <= 189 )) [L584] COND FALSE !(( ((-108 < a17) && (111 >= a17)) && ((a7==14) && ((a5==5) && (((a24==13) && (input == 6)) && a2 <= 189 ))))) [L591] COND FALSE !((( ((-108 < a17) && (111 >= a17)) && ((((input == 3) && ((a7==13) || (a7==14))) && (a5==6)) && (a24==15))) && a2 <= 189 )) [L598] COND FALSE !(( ((189 < a2) && (281 >= a2)) && (((a24==14) && ((a7==13) && ((a5==3) && (input == 5)))) && ((111 < a17) && (255 >= a17)) ))) [L605] COND FALSE !(( a2 <= 189 && ((a24==14) && ( ((-108 < a17) && (111 >= a17)) && (((input == 2) && ((a7==14) || ((a7==12) || (a7==13)))) && (a5==6)))))) [L611] COND FALSE !(((a5==5) && (((((((a7==12) || (a7==13)) || (a7==14)) && (input == 2)) && a17 <= -108 ) && ((189 < a2) && (281 >= a2)) ) && (a24==15)))) [L618] COND FALSE !(( a2 <= 189 && (( ((-108 < a17) && (111 >= a17)) && ((a24==14) && ((input == 3) && ((a7==14) || ((a7==12) || (a7==13)))))) && (a5==5)))) [L625] COND FALSE !((((((input == 5) && ((( ((111 < a17) && (255 >= a17)) && (a7==13)) || ( ((111 < a17) && (255 >= a17)) && (a7==14))) || ( 255 < a17 && (a7==12)))) && (a24==14)) && (a5==5)) && ((189 < a2) && (281 >= a2)) )) [L633] COND FALSE !(((a24==13) && ((((((a7==14) && ((111 < a17) && (255 >= a17)) ) || ((a7==12) && 255 < a17 )) && (input == 5)) && (a5==4)) && ((189 < a2) && (281 >= a2)) ))) [L640] COND FALSE !((((((a24==14) && (((a7==13) || (a7==14)) && (input == 4))) && ((189 < a2) && (281 >= a2)) ) && (a5==4)) && 255 < a17 )) [L648] COND FALSE !(((a5==6) && (((a24==13) && ((input == 2) && (( ((111 < a17) && (255 >= a17)) && (a7==12)) || (( ((-108 < a17) && (111 >= a17)) && (a7==13)) || ( ((-108 < a17) && (111 >= a17)) && (a7==14)))))) && a2 <= 189 ))) [L654] COND FALSE !((((a5==5) && ( ((-108 < a17) && (111 >= a17)) && (((a7==14) && (input == 5)) && (a24==13)))) && ((189 < a2) && (281 >= a2)) )) [L662] COND FALSE !(((a5==4) && ((((((a7==12) && 255 < a17 ) || (( ((111 < a17) && (255 >= a17)) && (a7==13)) || ((a7==14) && ((111 < a17) && (255 >= a17)) ))) && (input == 3)) && (a24==14)) && ((189 < a2) && (281 >= a2)) ))) [L667] COND FALSE !(((a7==14) && ((a5==5) && ((( ((-108 < a17) && (111 >= a17)) && (input == 2)) && (a24==13)) && ((189 < a2) && (281 >= a2)) )))) [L674] COND FALSE !((( ((189 < a2) && (281 >= a2)) && ((((input == 1) && (a5==6)) && (a24==13)) && (a7==13))) && 255 < a17 )) [L681] COND FALSE !(((a5==6) && ( ((-108 < a17) && (111 >= a17)) && ( ((189 < a2) && (281 >= a2)) && ((((a7==12) || (a7==13)) && (input == 2)) && (a24==13)))))) [L688] COND FALSE !(((((a5==4) && ((((a7==13) || (a7==14)) && (input == 5)) && a2 <= 189 )) && ((-108 < a17) && (111 >= a17)) ) && (a24==15))) [L695] COND FALSE !(( ((-108 < a17) && (111 >= a17)) && (((((a24==13) && (input == 4)) && (a5==5)) && (a7==14)) && ((189 < a2) && (281 >= a2)) ))) [L703] COND FALSE !((( a2 <= 189 && ((input == 4) && (((a24==13) && ( 255 < a17 && (a7==14))) || ((a24==14) && ( a17 <= -108 && (a7==12)))))) && (a5==7))) [L710] COND FALSE !(((a5==5) && ((a24==13) && ( a2 <= 189 && ((a7==14) && ( ((-108 < a17) && (111 >= a17)) && (input == 5))))))) [L716] COND FALSE !(((((a24==14) && ((input == 2) && ((( ((111 < a17) && (255 >= a17)) && (a7==13)) || ((a7==14) && ((111 < a17) && (255 >= a17)) )) || ((a7==12) && 255 < a17 )))) && (a5==4)) && ((189 < a2) && (281 >= a2)) )) [L724] COND TRUE (( a17 <= -108 && ((a5==4) && ( a2 <= 189 && ((input == 6) && ((a7==13) || (a7==14)))))) && (a24==15)) [L725] a17 = ((((((a17 % 109)- -74) * 5) * 5) % 109)- -2) [L726] a7 = 14 [L728] RET return 21; [L4826] EXPR calculate_output(input) [L4826] output = calculate_output(input) [L4818] COND TRUE 1 [L4821] int input; [L4822] input = __VERIFIER_nondet_int() [L4823] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L4826] CALL calculate_output(input) [L29] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==3))) [L32] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==4))) [L35] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==4))) [L38] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==4))) [L41] COND FALSE !((((((a7==13) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==4))) [L44] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==4))) [L47] COND FALSE !((((((a7==12) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==3))) [L50] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==4))) [L53] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==3))) [L56] COND FALSE !((((((a7==13) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==3))) [L59] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==15)) && (a5==3))) [L62] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==15)) && (a5==3))) [L65] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==4))) [L68] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==3))) [L71] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==15)) && (a5==3))) [L74] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==4))) [L77] COND FALSE !((((((a7==13) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==3))) [L80] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==3))) [L83] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==13)) && (a5==4))) [L86] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==15)) && (a5==3))) [L89] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==4))) [L92] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==3))) [L95] COND FALSE !((((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==3))) [L98] COND FALSE !((((((a7==12) && a2 <= 189 ) && 255 < a17 ) && (a24==13)) && (a5==3))) [L101] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==14)) && (a5==4))) [L104] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((-108 < a17) && (111 >= a17)) ) && (a24==15)) && (a5==3))) [L107] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==4))) [L110] COND FALSE !((((((a7==13) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==4))) [L113] COND FALSE !((((((a7==14) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==4))) [L116] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==15)) && (a5==3))) [L119] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==13)) && (a5==3))) [L122] COND FALSE !((((((a7==13) && a2 <= 189 ) && 255 < a17 ) && (a24==14)) && (a5==4))) [L125] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==4))) [L128] COND FALSE !((((((a7==12) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==3))) [L131] COND FALSE !((((((a7==12) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==14)) && (a5==3))) [L134] COND FALSE !((((((a7==14) && a2 <= 189 ) && ((111 < a17) && (255 >= a17)) ) && (a24==13)) && (a5==4))) [L137] COND TRUE (((((a7==14) && a2 <= 189 ) && a17 <= -108 ) && (a24==14)) && (a5==4)) [L138] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 840 locations, 1 error locations. UNKNOWN Result, 66.6s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 59.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3354 SDtfs, 7765 SDslu, 1339 SDs, 0 SdLazy, 30319 SolverSat, 3706 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 51.8s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 582 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4682occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.4s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.9974415290742765 AbsIntWeakeningRatio, 0.13829787234042554 AbsIntAvgWeakeningVarsNumRemoved, 1.7925531914893618 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 4 MinimizatonAttempts, 13 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/Problem12_label49_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-11_19-05-49-497.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem12_label49_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-11_19-05-49-497.csv Received shutdown request...