java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label46.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 19:13:02,527 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 19:13:02,529 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 19:13:02,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 19:13:02,542 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 19:13:02,543 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 19:13:02,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 19:13:02,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 19:13:02,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 19:13:02,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 19:13:02,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 19:13:02,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 19:13:02,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 19:13:02,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 19:13:02,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 19:13:02,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 19:13:02,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 19:13:02,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 19:13:02,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 19:13:02,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 19:13:02,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 19:13:02,563 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 19:13:02,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 19:13:02,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 19:13:02,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 19:13:02,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 19:13:02,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 19:13:02,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 19:13:02,569 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 19:13:02,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 19:13:02,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 19:13:02,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 19:13:02,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 19:13:02,574 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 19:13:02,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 19:13:02,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 19:13:02,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 19:13:02,579 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 19:13:02,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 19:13:02,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 19:13:02,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 19:13:02,581 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-02 19:13:02,611 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 19:13:02,612 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 19:13:02,612 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 19:13:02,613 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 19:13:02,614 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 19:13:02,614 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 19:13:02,614 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 19:13:02,614 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 19:13:02,614 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 19:13:02,615 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 19:13:02,617 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 19:13:02,617 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 19:13:02,617 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 19:13:02,618 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 19:13:02,618 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 19:13:02,618 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 19:13:02,618 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 19:13:02,618 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 19:13:02,619 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 19:13:02,619 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 19:13:02,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 19:13:02,619 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 19:13:02,620 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 19:13:02,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 19:13:02,620 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 19:13:02,620 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 19:13:02,621 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 19:13:02,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 19:13:02,621 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 19:13:02,621 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 19:13:02,680 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 19:13:02,695 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 19:13:02,698 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 19:13:02,699 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 19:13:02,700 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 19:13:02,700 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label46.c [2019-10-02 19:13:02,760 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e765f6f4f/9ed98509e68c4b40bb232c7cdf643bf3/FLAG051982ebb [2019-10-02 19:13:03,283 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 19:13:03,284 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label46.c [2019-10-02 19:13:03,296 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e765f6f4f/9ed98509e68c4b40bb232c7cdf643bf3/FLAG051982ebb [2019-10-02 19:13:03,571 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e765f6f4f/9ed98509e68c4b40bb232c7cdf643bf3 [2019-10-02 19:13:03,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 19:13:03,584 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 19:13:03,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 19:13:03,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 19:13:03,589 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 19:13:03,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 07:13:03" (1/1) ... [2019-10-02 19:13:03,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2330e191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:13:03, skipping insertion in model container [2019-10-02 19:13:03,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 07:13:03" (1/1) ... [2019-10-02 19:13:03,601 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 19:13:03,647 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 19:13:04,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 19:13:04,159 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 19:13:04,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 19:13:04,296 INFO L192 MainTranslator]: Completed translation [2019-10-02 19:13:04,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:13:04 WrapperNode [2019-10-02 19:13:04,297 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 19:13:04,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 19:13:04,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 19:13:04,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 19:13:04,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:13:04" (1/1) ... [2019-10-02 19:13:04,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:13:04" (1/1) ... [2019-10-02 19:13:04,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:13:04" (1/1) ... [2019-10-02 19:13:04,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:13:04" (1/1) ... [2019-10-02 19:13:04,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:13:04" (1/1) ... [2019-10-02 19:13:04,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:13:04" (1/1) ... [2019-10-02 19:13:04,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:13:04" (1/1) ... [2019-10-02 19:13:04,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 19:13:04,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 19:13:04,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 19:13:04,458 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 19:13:04,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:13:04" (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 [2019-10-02 19:13:04,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 19:13:04,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 19:13:04,538 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 19:13:04,538 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 19:13:04,539 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 19:13:04,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 19:13:04,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 19:13:04,539 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 19:13:04,540 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 19:13:04,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 19:13:04,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 19:13:05,883 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 19:13:05,883 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 19:13:05,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 07:13:05 BoogieIcfgContainer [2019-10-02 19:13:05,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 19:13:05,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 19:13:05,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 19:13:05,891 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 19:13:05,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 07:13:03" (1/3) ... [2019-10-02 19:13:05,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c21962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 07:13:05, skipping insertion in model container [2019-10-02 19:13:05,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:13:04" (2/3) ... [2019-10-02 19:13:05,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c21962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 07:13:05, skipping insertion in model container [2019-10-02 19:13:05,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 07:13:05" (3/3) ... [2019-10-02 19:13:05,895 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label46.c [2019-10-02 19:13:05,906 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 19:13:05,917 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 19:13:05,936 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 19:13:05,977 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 19:13:05,978 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 19:13:05,978 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 19:13:05,979 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 19:13:05,979 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 19:13:05,979 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 19:13:05,979 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 19:13:05,980 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 19:13:06,020 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2019-10-02 19:13:06,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-02 19:13:06,034 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 19:13:06,036 INFO L411 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] [2019-10-02 19:13:06,039 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 19:13:06,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 19:13:06,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1887861606, now seen corresponding path program 1 times [2019-10-02 19:13:06,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 19:13:06,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:13:06,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 19:13:06,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:13:06,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 19:13:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 19:13:06,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 19:13:06,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 19:13:06,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 19:13:06,429 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 19:13:06,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 19:13:06,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 19:13:06,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 19:13:06,455 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 3 states. [2019-10-02 19:13:07,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 19:13:07,486 INFO L93 Difference]: Finished difference Result 362 states and 538 transitions. [2019-10-02 19:13:07,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 19:13:07,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-02 19:13:07,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 19:13:07,523 INFO L225 Difference]: With dead ends: 362 [2019-10-02 19:13:07,523 INFO L226 Difference]: Without dead ends: 294 [2019-10-02 19:13:07,528 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 19:13:07,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-02 19:13:07,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2019-10-02 19:13:07,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-02 19:13:07,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 421 transitions. [2019-10-02 19:13:07,639 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 421 transitions. Word has length 27 [2019-10-02 19:13:07,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 19:13:07,639 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 421 transitions. [2019-10-02 19:13:07,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 19:13:07,640 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 421 transitions. [2019-10-02 19:13:07,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 19:13:07,644 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 19:13:07,645 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 19:13:07,645 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 19:13:07,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 19:13:07,646 INFO L82 PathProgramCache]: Analyzing trace with hash 95026773, now seen corresponding path program 1 times [2019-10-02 19:13:07,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 19:13:07,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:13:07,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 19:13:07,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:13:07,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 19:13:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 19:13:07,849 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 19:13:07,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 19:13:07,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 19:13:07,850 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 19:13:07,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 19:13:07,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 19:13:07,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 19:13:07,853 INFO L87 Difference]: Start difference. First operand 294 states and 421 transitions. Second operand 6 states. [2019-10-02 19:13:08,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 19:13:08,797 INFO L93 Difference]: Finished difference Result 453 states and 620 transitions. [2019-10-02 19:13:08,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 19:13:08,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-02 19:13:08,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 19:13:08,802 INFO L225 Difference]: With dead ends: 453 [2019-10-02 19:13:08,802 INFO L226 Difference]: Without dead ends: 453 [2019-10-02 19:13:08,803 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 19:13:08,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-10-02 19:13:08,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 445. [2019-10-02 19:13:08,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-10-02 19:13:08,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 606 transitions. [2019-10-02 19:13:08,837 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 606 transitions. Word has length 96 [2019-10-02 19:13:08,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 19:13:08,838 INFO L475 AbstractCegarLoop]: Abstraction has 445 states and 606 transitions. [2019-10-02 19:13:08,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 19:13:08,838 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 606 transitions. [2019-10-02 19:13:08,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-02 19:13:08,842 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 19:13:08,842 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 19:13:08,842 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 19:13:08,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 19:13:08,843 INFO L82 PathProgramCache]: Analyzing trace with hash 881976969, now seen corresponding path program 1 times [2019-10-02 19:13:08,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 19:13:08,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:13:08,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 19:13:08,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:13:08,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 19:13:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-02 19:13:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-02 19:13:08,991 INFO L478 BasicCegarLoop]: Counterexample might be feasible [2019-10-02 19:13:09,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 07:13:09 BoogieIcfgContainer [2019-10-02 19:13:09,112 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 19:13:09,118 INFO L168 Benchmark]: Toolchain (without parser) took 5530.44 ms. Allocated memory was 131.6 MB in the beginning and 273.2 MB in the end (delta: 141.6 MB). Free memory was 85.4 MB in the beginning and 190.4 MB in the end (delta: -105.0 MB). Peak memory consumption was 36.6 MB. Max. memory is 7.1 GB. [2019-10-02 19:13:09,119 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 131.6 MB. Free memory was 104.5 MB in the beginning and 104.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 19:13:09,124 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.32 ms. Allocated memory was 131.6 MB in the beginning and 202.4 MB in the end (delta: 70.8 MB). Free memory was 85.2 MB in the beginning and 166.3 MB in the end (delta: -81.1 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. [2019-10-02 19:13:09,125 INFO L168 Benchmark]: Boogie Preprocessor took 159.33 ms. Allocated memory is still 202.4 MB. Free memory was 166.3 MB in the beginning and 161.5 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2019-10-02 19:13:09,128 INFO L168 Benchmark]: RCFGBuilder took 1427.56 ms. Allocated memory was 202.4 MB in the beginning and 223.3 MB in the end (delta: 21.0 MB). Free memory was 161.5 MB in the beginning and 178.6 MB in the end (delta: -17.1 MB). Peak memory consumption was 93.4 MB. Max. memory is 7.1 GB. [2019-10-02 19:13:09,130 INFO L168 Benchmark]: TraceAbstraction took 3225.01 ms. Allocated memory was 223.3 MB in the beginning and 273.2 MB in the end (delta: 49.8 MB). Free memory was 178.6 MB in the beginning and 190.4 MB in the end (delta: -11.8 MB). Peak memory consumption was 38.0 MB. Max. memory is 7.1 GB. [2019-10-02 19:13:09,134 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 131.6 MB. Free memory was 104.5 MB in the beginning and 104.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 712.32 ms. Allocated memory was 131.6 MB in the beginning and 202.4 MB in the end (delta: 70.8 MB). Free memory was 85.2 MB in the beginning and 166.3 MB in the end (delta: -81.1 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 159.33 ms. Allocated memory is still 202.4 MB. Free memory was 166.3 MB in the beginning and 161.5 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1427.56 ms. Allocated memory was 202.4 MB in the beginning and 223.3 MB in the end (delta: 21.0 MB). Free memory was 161.5 MB in the beginning and 178.6 MB in the end (delta: -17.1 MB). Peak memory consumption was 93.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3225.01 ms. Allocated memory was 223.3 MB in the beginning and 273.2 MB in the end (delta: 49.8 MB). Free memory was 178.6 MB in the beginning and 190.4 MB in the end (delta: -11.8 MB). Peak memory consumption was 38.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 67]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; VAL [\old(a1)=331507, \old(a10)=331511, \old(a12)=331515, \old(a19)=331508, \old(a4)=331512, \old(inputB)=331514, \old(inputC)=331513, \old(inputD)=331509, \old(inputE)=331506, \old(inputF)=331510, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L579] int output = -1; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND TRUE (((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)) [L255] a1 = (((a1 / 5) + 110755) + 220746) [L256] a10 = 1 [L257] a19 = 8 [L259] return -1; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, \result=-1, a1=331505, a10=1, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] RET, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=331505, a10=1, a12=0, a19=8, a4=14, calculate_output(input)=-1, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] CALL calculate_output(input) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND TRUE (((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] __VERIFIER_error() VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. UNSAFE Result, 3.1s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 81 SDtfs, 681 SDslu, 43 SDs, 0 SdLazy, 1025 SolverSat, 344 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=445occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 54893 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 20/20 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...