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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label48.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 01:05:17,786 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 01:05:17,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 01:05:17,800 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 01:05:17,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 01:05:17,802 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 01:05:17,803 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 01:05:17,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 01:05:17,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 01:05:17,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 01:05:17,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 01:05:17,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 01:05:17,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 01:05:17,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 01:05:17,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 01:05:17,814 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 01:05:17,815 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 01:05:17,816 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 01:05:17,818 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 01:05:17,820 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 01:05:17,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 01:05:17,823 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 01:05:17,824 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 01:05:17,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 01:05:17,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 01:05:17,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 01:05:17,828 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 01:05:17,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 01:05:17,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 01:05:17,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 01:05:17,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 01:05:17,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 01:05:17,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 01:05:17,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 01:05:17,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 01:05:17,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 01:05:17,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 01:05:17,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 01:05:17,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 01:05:17,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 01:05:17,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 01:05:17,839 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 01:05:17,859 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 01:05:17,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 01:05:17,860 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 01:05:17,861 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 01:05:17,861 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 01:05:17,861 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 01:05:17,861 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 01:05:17,861 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 01:05:17,862 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 01:05:17,862 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 01:05:17,862 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 01:05:17,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 01:05:17,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 01:05:17,863 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 01:05:17,863 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 01:05:17,863 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 01:05:17,863 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 01:05:17,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 01:05:17,864 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 01:05:17,864 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 01:05:17,864 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 01:05:17,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:05:17,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 01:05:17,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 01:05:17,865 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 01:05:17,865 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 01:05:17,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 01:05:17,865 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 01:05:17,866 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 01:05:17,894 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 01:05:17,907 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 01:05:17,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 01:05:17,912 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 01:05:17,912 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 01:05:17,913 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label48.c [2019-10-02 01:05:17,975 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1df0752e6/32f934e2339b49f084fe6b210a353eb9/FLAG9ea871633 [2019-10-02 01:05:18,467 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 01:05:18,468 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label48.c [2019-10-02 01:05:18,484 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1df0752e6/32f934e2339b49f084fe6b210a353eb9/FLAG9ea871633 [2019-10-02 01:05:18,808 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1df0752e6/32f934e2339b49f084fe6b210a353eb9 [2019-10-02 01:05:18,818 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 01:05:18,820 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 01:05:18,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 01:05:18,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 01:05:18,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 01:05:18,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:05:18" (1/1) ... [2019-10-02 01:05:18,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b0106d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:05:18, skipping insertion in model container [2019-10-02 01:05:18,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:05:18" (1/1) ... [2019-10-02 01:05:18,837 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 01:05:18,893 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 01:05:19,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:05:19,431 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 01:05:19,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:05:19,584 INFO L192 MainTranslator]: Completed translation [2019-10-02 01:05:19,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:05:19 WrapperNode [2019-10-02 01:05:19,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 01:05:19,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 01:05:19,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 01:05:19,586 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 01:05:19,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:05:19" (1/1) ... [2019-10-02 01:05:19,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:05:19" (1/1) ... [2019-10-02 01:05:19,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:05:19" (1/1) ... [2019-10-02 01:05:19,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:05:19" (1/1) ... [2019-10-02 01:05:19,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:05:19" (1/1) ... [2019-10-02 01:05:19,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:05:19" (1/1) ... [2019-10-02 01:05:19,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:05:19" (1/1) ... [2019-10-02 01:05:19,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 01:05:19,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 01:05:19,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 01:05:19,690 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 01:05:19,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:05:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:05:19,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 01:05:19,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 01:05:19,775 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 01:05:19,775 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 01:05:19,777 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 01:05:19,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 01:05:19,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 01:05:19,777 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 01:05:19,778 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 01:05:19,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 01:05:19,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 01:05:21,160 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 01:05:21,161 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 01:05:21,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:05:21 BoogieIcfgContainer [2019-10-02 01:05:21,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 01:05:21,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 01:05:21,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 01:05:21,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 01:05:21,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:05:18" (1/3) ... [2019-10-02 01:05:21,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65fe4cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:05:21, skipping insertion in model container [2019-10-02 01:05:21,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:05:19" (2/3) ... [2019-10-02 01:05:21,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65fe4cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:05:21, skipping insertion in model container [2019-10-02 01:05:21,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:05:21" (3/3) ... [2019-10-02 01:05:21,170 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label48.c [2019-10-02 01:05:21,179 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 01:05:21,188 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 01:05:21,205 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 01:05:21,237 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 01:05:21,238 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 01:05:21,238 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 01:05:21,238 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 01:05:21,239 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 01:05:21,239 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 01:05:21,239 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 01:05:21,239 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 01:05:21,239 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 01:05:21,263 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2019-10-02 01:05:21,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-02 01:05:21,268 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:05:21,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:05:21,272 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:05:21,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:05:21,277 INFO L82 PathProgramCache]: Analyzing trace with hash 54045006, now seen corresponding path program 1 times [2019-10-02 01:05:21,280 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:05:21,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:05:21,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:05:21,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:05:21,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:05:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:05:21,483 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 01:05:21,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:05:21,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 01:05:21,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:05:21,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:05:21,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:05:21,507 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 3 states. [2019-10-02 01:05:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:05:22,503 INFO L93 Difference]: Finished difference Result 571 states and 989 transitions. [2019-10-02 01:05:22,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:05:22,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-02 01:05:22,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:05:22,534 INFO L225 Difference]: With dead ends: 571 [2019-10-02 01:05:22,534 INFO L226 Difference]: Without dead ends: 294 [2019-10-02 01:05:22,545 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 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 01:05:22,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-02 01:05:22,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2019-10-02 01:05:22,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-02 01:05:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 446 transitions. [2019-10-02 01:05:22,650 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 446 transitions. Word has length 13 [2019-10-02 01:05:22,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:05:22,651 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 446 transitions. [2019-10-02 01:05:22,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:05:22,651 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 446 transitions. [2019-10-02 01:05:22,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-02 01:05:22,657 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:05:22,657 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 01:05:22,658 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:05:22,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:05:22,659 INFO L82 PathProgramCache]: Analyzing trace with hash 58156773, now seen corresponding path program 1 times [2019-10-02 01:05:22,659 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:05:22,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:05:22,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:05:22,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:05:22,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:05:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:05:22,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:05:22,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:05:22,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:05:22,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:05:22,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:05:22,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:05:22,983 INFO L87 Difference]: Start difference. First operand 294 states and 446 transitions. Second operand 6 states. [2019-10-02 01:05:23,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:05:23,897 INFO L93 Difference]: Finished difference Result 741 states and 1136 transitions. [2019-10-02 01:05:23,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:05:23,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-10-02 01:05:23,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:05:23,903 INFO L225 Difference]: With dead ends: 741 [2019-10-02 01:05:23,903 INFO L226 Difference]: Without dead ends: 453 [2019-10-02 01:05:23,905 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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 01:05:23,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-10-02 01:05:23,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 445. [2019-10-02 01:05:23,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-10-02 01:05:23,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 626 transitions. [2019-10-02 01:05:23,933 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 626 transitions. Word has length 86 [2019-10-02 01:05:23,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:05:23,933 INFO L475 AbstractCegarLoop]: Abstraction has 445 states and 626 transitions. [2019-10-02 01:05:23,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:05:23,934 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 626 transitions. [2019-10-02 01:05:23,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 01:05:23,937 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:05:23,937 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 01:05:23,938 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:05:23,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:05:23,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1907689263, now seen corresponding path program 1 times [2019-10-02 01:05:23,938 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:05:23,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:05:23,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:05:23,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:05:23,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:05:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:05:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:05:24,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:05:24,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 01:05:24,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:05:24,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:05:24,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:05:24,033 INFO L87 Difference]: Start difference. First operand 445 states and 626 transitions. Second operand 3 states. [2019-10-02 01:05:24,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:05:24,649 INFO L93 Difference]: Finished difference Result 1319 states and 1891 transitions. [2019-10-02 01:05:24,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:05:24,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-10-02 01:05:24,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:05:24,655 INFO L225 Difference]: With dead ends: 1319 [2019-10-02 01:05:24,655 INFO L226 Difference]: Without dead ends: 880 [2019-10-02 01:05:24,657 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 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 01:05:24,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-10-02 01:05:24,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2019-10-02 01:05:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2019-10-02 01:05:24,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1152 transitions. [2019-10-02 01:05:24,695 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1152 transitions. Word has length 92 [2019-10-02 01:05:24,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:05:24,696 INFO L475 AbstractCegarLoop]: Abstraction has 880 states and 1152 transitions. [2019-10-02 01:05:24,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:05:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1152 transitions. [2019-10-02 01:05:24,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-02 01:05:24,703 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:05:24,703 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 01:05:24,704 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:05:24,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:05:24,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1492328462, now seen corresponding path program 1 times [2019-10-02 01:05:24,704 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:05:24,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:05:24,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:05:24,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:05:24,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:05:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:05:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:05:24,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:05:24,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:05:24,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:05:24,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:05:24,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:05:24,928 INFO L87 Difference]: Start difference. First operand 880 states and 1152 transitions. Second operand 6 states. [2019-10-02 01:05:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:05:25,840 INFO L93 Difference]: Finished difference Result 2078 states and 2807 transitions. [2019-10-02 01:05:25,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:05:25,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2019-10-02 01:05:25,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:05:25,848 INFO L225 Difference]: With dead ends: 2078 [2019-10-02 01:05:25,849 INFO L226 Difference]: Without dead ends: 1204 [2019-10-02 01:05:25,854 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:05:25,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2019-10-02 01:05:25,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1192. [2019-10-02 01:05:25,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2019-10-02 01:05:25,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1576 transitions. [2019-10-02 01:05:25,901 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1576 transitions. Word has length 103 [2019-10-02 01:05:25,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:05:25,901 INFO L475 AbstractCegarLoop]: Abstraction has 1192 states and 1576 transitions. [2019-10-02 01:05:25,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:05:25,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1576 transitions. [2019-10-02 01:05:25,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-02 01:05:25,905 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:05:25,906 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 01:05:25,906 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:05:25,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:05:25,906 INFO L82 PathProgramCache]: Analyzing trace with hash -28083010, now seen corresponding path program 1 times [2019-10-02 01:05:25,907 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:05:25,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:05:25,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:05:25,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:05:25,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:05:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:05:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:05:26,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:05:26,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:05:26,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:05:26,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:05:26,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:05:26,158 INFO L87 Difference]: Start difference. First operand 1192 states and 1576 transitions. Second operand 6 states. [2019-10-02 01:05:27,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:05:27,077 INFO L93 Difference]: Finished difference Result 2688 states and 3628 transitions. [2019-10-02 01:05:27,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:05:27,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2019-10-02 01:05:27,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:05:27,089 INFO L225 Difference]: With dead ends: 2688 [2019-10-02 01:05:27,089 INFO L226 Difference]: Without dead ends: 1502 [2019-10-02 01:05:27,092 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 01:05:27,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2019-10-02 01:05:27,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1339. [2019-10-02 01:05:27,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2019-10-02 01:05:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 1748 transitions. [2019-10-02 01:05:27,154 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 1748 transitions. Word has length 125 [2019-10-02 01:05:27,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:05:27,155 INFO L475 AbstractCegarLoop]: Abstraction has 1339 states and 1748 transitions. [2019-10-02 01:05:27,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:05:27,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1748 transitions. [2019-10-02 01:05:27,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-02 01:05:27,158 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:05:27,159 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:05:27,159 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:05:27,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:05:27,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1911741586, now seen corresponding path program 1 times [2019-10-02 01:05:27,159 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:05:27,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:05:27,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:05:27,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:05:27,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:05:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:05:27,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:05:27,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:05:27,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:05:27,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:05:27,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:05:27,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:05:27,356 INFO L87 Difference]: Start difference. First operand 1339 states and 1748 transitions. Second operand 6 states. [2019-10-02 01:05:28,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:05:28,257 INFO L93 Difference]: Finished difference Result 2692 states and 3545 transitions. [2019-10-02 01:05:28,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:05:28,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2019-10-02 01:05:28,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:05:28,264 INFO L225 Difference]: With dead ends: 2692 [2019-10-02 01:05:28,265 INFO L226 Difference]: Without dead ends: 1359 [2019-10-02 01:05:28,268 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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 01:05:28,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2019-10-02 01:05:28,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1204. [2019-10-02 01:05:28,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2019-10-02 01:05:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1482 transitions. [2019-10-02 01:05:28,308 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1482 transitions. Word has length 149 [2019-10-02 01:05:28,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:05:28,309 INFO L475 AbstractCegarLoop]: Abstraction has 1204 states and 1482 transitions. [2019-10-02 01:05:28,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:05:28,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1482 transitions. [2019-10-02 01:05:28,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 01:05:28,313 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:05:28,313 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:05:28,314 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:05:28,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:05:28,314 INFO L82 PathProgramCache]: Analyzing trace with hash -782626831, now seen corresponding path program 1 times [2019-10-02 01:05:28,314 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:05:28,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:05:28,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:05:28,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:05:28,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:05:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:05:28,566 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-02 01:05:28,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:05:28,566 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:05:28,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:05:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:05:28,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:05:28,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:05:28,851 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:05:28,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:05:28,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-02 01:05:28,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 01:05:28,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 01:05:28,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-10-02 01:05:28,860 INFO L87 Difference]: Start difference. First operand 1204 states and 1482 transitions. Second operand 11 states. [2019-10-02 01:05:31,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:05:31,376 INFO L93 Difference]: Finished difference Result 3864 states and 4804 transitions. [2019-10-02 01:05:31,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 01:05:31,376 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 228 [2019-10-02 01:05:31,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:05:31,384 INFO L225 Difference]: With dead ends: 3864 [2019-10-02 01:05:31,385 INFO L226 Difference]: Without dead ends: 1631 [2019-10-02 01:05:31,390 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2019-10-02 01:05:31,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-10-02 01:05:31,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1190. [2019-10-02 01:05:31,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1190 states. [2019-10-02 01:05:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1345 transitions. [2019-10-02 01:05:31,434 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1345 transitions. Word has length 228 [2019-10-02 01:05:31,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:05:31,434 INFO L475 AbstractCegarLoop]: Abstraction has 1190 states and 1345 transitions. [2019-10-02 01:05:31,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 01:05:31,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1345 transitions. [2019-10-02 01:05:31,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-02 01:05:31,438 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:05:31,439 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:05:31,439 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:05:31,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:05:31,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1580433939, now seen corresponding path program 1 times [2019-10-02 01:05:31,440 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:05:31,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:05:31,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:05:31,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:05:31,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:05:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:05:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 87 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:05:32,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:05:32,062 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:05:32,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:05:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:05:32,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 01:05:32,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:05:32,444 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 01:05:32,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:05:32,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 16 [2019-10-02 01:05:32,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 01:05:32,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 01:05:32,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-10-02 01:05:32,453 INFO L87 Difference]: Start difference. First operand 1190 states and 1345 transitions. Second operand 16 states. [2019-10-02 01:05:33,243 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-10-02 01:05:35,073 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2019-10-02 01:05:39,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:05:39,783 INFO L93 Difference]: Finished difference Result 3592 states and 4285 transitions. [2019-10-02 01:05:39,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 01:05:39,785 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 242 [2019-10-02 01:05:39,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:05:39,796 INFO L225 Difference]: With dead ends: 3592 [2019-10-02 01:05:39,797 INFO L226 Difference]: Without dead ends: 2406 [2019-10-02 01:05:39,801 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=597, Invalid=1755, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 01:05:39,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2406 states. [2019-10-02 01:05:39,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2406 to 2064. [2019-10-02 01:05:39,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2064 states. [2019-10-02 01:05:39,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2354 transitions. [2019-10-02 01:05:39,868 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2354 transitions. Word has length 242 [2019-10-02 01:05:39,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:05:39,868 INFO L475 AbstractCegarLoop]: Abstraction has 2064 states and 2354 transitions. [2019-10-02 01:05:39,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 01:05:39,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2354 transitions. [2019-10-02 01:05:39,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-10-02 01:05:39,875 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:05:39,875 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:05:39,876 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:05:39,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:05:39,876 INFO L82 PathProgramCache]: Analyzing trace with hash -2028110983, now seen corresponding path program 1 times [2019-10-02 01:05:39,876 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:05:39,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:05:39,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:05:39,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:05:39,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:05:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:05:40,154 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-02 01:05:40,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:05:40,154 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:05:40,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:05:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:05:40,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 01:05:40,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:05:40,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:05:40,347 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 01:05:40,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:05:40,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-10-02 01:05:40,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 01:05:40,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 01:05:40,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-02 01:05:40,365 INFO L87 Difference]: Start difference. First operand 2064 states and 2354 transitions. Second operand 10 states. [2019-10-02 01:05:43,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:05:43,849 INFO L93 Difference]: Finished difference Result 6077 states and 7032 transitions. [2019-10-02 01:05:43,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 01:05:43,850 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 264 [2019-10-02 01:05:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:05:43,869 INFO L225 Difference]: With dead ends: 6077 [2019-10-02 01:05:43,869 INFO L226 Difference]: Without dead ends: 4017 [2019-10-02 01:05:43,875 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2019-10-02 01:05:43,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4017 states. [2019-10-02 01:05:43,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4017 to 3542. [2019-10-02 01:05:43,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3542 states. [2019-10-02 01:05:43,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3542 states and 3965 transitions. [2019-10-02 01:05:43,970 INFO L78 Accepts]: Start accepts. Automaton has 3542 states and 3965 transitions. Word has length 264 [2019-10-02 01:05:43,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:05:43,971 INFO L475 AbstractCegarLoop]: Abstraction has 3542 states and 3965 transitions. [2019-10-02 01:05:43,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 01:05:43,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 3965 transitions. [2019-10-02 01:05:43,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-10-02 01:05:43,979 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:05:43,979 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 01:05:43,980 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:05:43,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:05:43,980 INFO L82 PathProgramCache]: Analyzing trace with hash -126778982, now seen corresponding path program 1 times [2019-10-02 01:05:43,980 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:05:43,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:05:43,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:05:43,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:05:43,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:05:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:05:44,520 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 82 proven. 74 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-02 01:05:44,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:05:44,521 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:05:44,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:05:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:05:44,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 01:05:44,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:05:44,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:05:44,796 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 164 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 01:05:44,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:05:44,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-02 01:05:44,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 01:05:44,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 01:05:44,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 01:05:44,811 INFO L87 Difference]: Start difference. First operand 3542 states and 3965 transitions. Second operand 11 states. [2019-10-02 01:05:49,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:05:49,666 INFO L93 Difference]: Finished difference Result 7618 states and 8995 transitions. [2019-10-02 01:05:49,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 01:05:49,666 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 273 [2019-10-02 01:05:49,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:05:49,693 INFO L225 Difference]: With dead ends: 7618 [2019-10-02 01:05:49,694 INFO L226 Difference]: Without dead ends: 4944 [2019-10-02 01:05:49,703 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 290 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=279, Invalid=1203, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 01:05:49,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4944 states. [2019-10-02 01:05:49,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4944 to 4269. [2019-10-02 01:05:49,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4269 states. [2019-10-02 01:05:49,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4269 states to 4269 states and 4743 transitions. [2019-10-02 01:05:49,875 INFO L78 Accepts]: Start accepts. Automaton has 4269 states and 4743 transitions. Word has length 273 [2019-10-02 01:05:49,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:05:49,875 INFO L475 AbstractCegarLoop]: Abstraction has 4269 states and 4743 transitions. [2019-10-02 01:05:49,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 01:05:49,876 INFO L276 IsEmpty]: Start isEmpty. Operand 4269 states and 4743 transitions. [2019-10-02 01:05:49,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-10-02 01:05:49,886 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:05:49,886 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 01:05:49,886 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:05:49,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:05:49,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1681862689, now seen corresponding path program 1 times [2019-10-02 01:05:49,887 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:05:49,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:05:49,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:05:49,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:05:49,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:05:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:05:50,347 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 170 proven. 75 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 01:05:50,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:05:50,347 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:05:50,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:05:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:05:50,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 01:05:50,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:05:50,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:05:50,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:05:50,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:05:50,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:05:50,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:05:50,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:05:50,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:05:50,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:05:50,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:05:50,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:05:50,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:05:50,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:05:50,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:05:50,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:05:50,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:05:50,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:05:50,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:05:50,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:05:50,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:05:50,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:05:50,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:05:50,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:05:51,099 WARN L191 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 24 [2019-10-02 01:05:51,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:05:51,248 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 165 proven. 2 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-10-02 01:05:51,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:05:51,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-10-02 01:05:51,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 01:05:51,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 01:05:51,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:05:51,255 INFO L87 Difference]: Start difference. First operand 4269 states and 4743 transitions. Second operand 15 states. [2019-10-02 01:06:00,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:06:00,600 INFO L93 Difference]: Finished difference Result 9567 states and 11287 transitions. [2019-10-02 01:06:00,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-02 01:06:00,600 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 286 [2019-10-02 01:06:00,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:06:00,629 INFO L225 Difference]: With dead ends: 9567 [2019-10-02 01:06:00,629 INFO L226 Difference]: Without dead ends: 5594 [2019-10-02 01:06:00,642 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 320 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1379 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=666, Invalid=3624, Unknown=0, NotChecked=0, Total=4290 [2019-10-02 01:06:00,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5594 states. [2019-10-02 01:06:00,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5594 to 5294. [2019-10-02 01:06:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5294 states. [2019-10-02 01:06:00,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5294 states to 5294 states and 5808 transitions. [2019-10-02 01:06:00,790 INFO L78 Accepts]: Start accepts. Automaton has 5294 states and 5808 transitions. Word has length 286 [2019-10-02 01:06:00,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:06:00,791 INFO L475 AbstractCegarLoop]: Abstraction has 5294 states and 5808 transitions. [2019-10-02 01:06:00,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 01:06:00,791 INFO L276 IsEmpty]: Start isEmpty. Operand 5294 states and 5808 transitions. [2019-10-02 01:06:00,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-10-02 01:06:00,803 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:06:00,804 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 01:06:00,804 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:06:00,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:06:00,805 INFO L82 PathProgramCache]: Analyzing trace with hash 888355118, now seen corresponding path program 1 times [2019-10-02 01:06:00,805 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:06:00,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:06:00,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:06:00,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:06:00,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:06:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:06:01,463 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 101 proven. 73 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-02 01:06:01,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:06:01,464 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:06:01,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:06:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:06:01,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 01:06:01,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:06:01,687 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-02 01:06:01,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:06:01,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-10-02 01:06:01,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 01:06:01,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 01:06:01,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:06:01,702 INFO L87 Difference]: Start difference. First operand 5294 states and 5808 transitions. Second operand 15 states. [2019-10-02 01:06:05,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:06:05,001 INFO L93 Difference]: Finished difference Result 9597 states and 10498 transitions. [2019-10-02 01:06:05,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 01:06:05,002 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 295 [2019-10-02 01:06:05,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:06:05,019 INFO L225 Difference]: With dead ends: 9597 [2019-10-02 01:06:05,019 INFO L226 Difference]: Without dead ends: 5169 [2019-10-02 01:06:05,030 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=236, Invalid=756, Unknown=0, NotChecked=0, Total=992 [2019-10-02 01:06:05,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5169 states. [2019-10-02 01:06:05,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5169 to 5145. [2019-10-02 01:06:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5145 states. [2019-10-02 01:06:05,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5145 states to 5145 states and 5604 transitions. [2019-10-02 01:06:05,130 INFO L78 Accepts]: Start accepts. Automaton has 5145 states and 5604 transitions. Word has length 295 [2019-10-02 01:06:05,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:06:05,130 INFO L475 AbstractCegarLoop]: Abstraction has 5145 states and 5604 transitions. [2019-10-02 01:06:05,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 01:06:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 5145 states and 5604 transitions. [2019-10-02 01:06:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-10-02 01:06:05,141 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:06:05,141 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 01:06:05,141 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:06:05,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:06:05,142 INFO L82 PathProgramCache]: Analyzing trace with hash 833908213, now seen corresponding path program 1 times [2019-10-02 01:06:05,142 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:06:05,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:06:05,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:06:05,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:06:05,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:06:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:06:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 170 proven. 73 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 01:06:05,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:06:05,706 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:06:05,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:06:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:06:05,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 01:06:05,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:06:05,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:06:05,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:06:06,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:06:07,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:06:07,282 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 20 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:06:07,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:06:07,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 23 [2019-10-02 01:06:07,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 01:06:07,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 01:06:07,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=415, Unknown=1, NotChecked=0, Total=506 [2019-10-02 01:06:07,288 INFO L87 Difference]: Start difference. First operand 5145 states and 5604 transitions. Second operand 23 states. [2019-10-02 01:06:15,539 WARN L191 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-10-02 01:06:20,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:06:20,040 INFO L93 Difference]: Finished difference Result 11104 states and 12308 transitions. [2019-10-02 01:06:20,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-02 01:06:20,041 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 304 [2019-10-02 01:06:20,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:06:20,061 INFO L225 Difference]: With dead ends: 11104 [2019-10-02 01:06:20,062 INFO L226 Difference]: Without dead ends: 6825 [2019-10-02 01:06:20,072 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 305 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1191 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=920, Invalid=3111, Unknown=1, NotChecked=0, Total=4032 [2019-10-02 01:06:20,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6825 states. [2019-10-02 01:06:20,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6825 to 5886. [2019-10-02 01:06:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5886 states. [2019-10-02 01:06:20,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5886 states to 5886 states and 6435 transitions. [2019-10-02 01:06:20,205 INFO L78 Accepts]: Start accepts. Automaton has 5886 states and 6435 transitions. Word has length 304 [2019-10-02 01:06:20,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:06:20,206 INFO L475 AbstractCegarLoop]: Abstraction has 5886 states and 6435 transitions. [2019-10-02 01:06:20,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 01:06:20,207 INFO L276 IsEmpty]: Start isEmpty. Operand 5886 states and 6435 transitions. [2019-10-02 01:06:20,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-10-02 01:06:20,222 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:06:20,222 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2019-10-02 01:06:20,223 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:06:20,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:06:20,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1083571854, now seen corresponding path program 1 times [2019-10-02 01:06:20,223 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:06:20,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:06:20,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:06:20,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:06:20,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:06:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-02 01:06:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-02 01:06:20,566 INFO L478 BasicCegarLoop]: Counterexample might be feasible [2019-10-02 01:06:20,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 01:06:20 BoogieIcfgContainer [2019-10-02 01:06:20,757 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 01:06:20,759 INFO L168 Benchmark]: Toolchain (without parser) took 61939.76 ms. Allocated memory was 137.9 MB in the beginning and 810.0 MB in the end (delta: 672.1 MB). Free memory was 84.4 MB in the beginning and 206.2 MB in the end (delta: -121.8 MB). Peak memory consumption was 550.3 MB. Max. memory is 7.1 GB. [2019-10-02 01:06:20,760 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 103.9 MB in the beginning and 103.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 01:06:20,761 INFO L168 Benchmark]: CACSL2BoogieTranslator took 764.31 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 84.1 MB in the beginning and 161.6 MB in the end (delta: -77.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-10-02 01:06:20,762 INFO L168 Benchmark]: Boogie Preprocessor took 104.30 ms. Allocated memory is still 200.8 MB. Free memory was 161.6 MB in the beginning and 156.9 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2019-10-02 01:06:20,763 INFO L168 Benchmark]: RCFGBuilder took 1472.32 ms. Allocated memory was 200.8 MB in the beginning and 220.7 MB in the end (delta: 19.9 MB). Free memory was 156.9 MB in the beginning and 172.7 MB in the end (delta: -15.8 MB). Peak memory consumption was 91.6 MB. Max. memory is 7.1 GB. [2019-10-02 01:06:20,764 INFO L168 Benchmark]: TraceAbstraction took 59593.99 ms. Allocated memory was 220.7 MB in the beginning and 810.0 MB in the end (delta: 589.3 MB). Free memory was 171.3 MB in the beginning and 206.2 MB in the end (delta: -34.9 MB). Peak memory consumption was 554.4 MB. Max. memory is 7.1 GB. [2019-10-02 01:06:20,768 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.23 ms. Allocated memory is still 137.9 MB. Free memory was 103.9 MB in the beginning and 103.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 764.31 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 84.1 MB in the beginning and 161.6 MB in the end (delta: -77.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 104.30 ms. Allocated memory is still 200.8 MB. Free memory was 161.6 MB in the beginning and 156.9 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1472.32 ms. Allocated memory was 200.8 MB in the beginning and 220.7 MB in the end (delta: 19.9 MB). Free memory was 156.9 MB in the beginning and 172.7 MB in the end (delta: -15.8 MB). Peak memory consumption was 91.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 59593.99 ms. Allocated memory was 220.7 MB in the beginning and 810.0 MB in the end (delta: 589.3 MB). Free memory was 171.3 MB in the beginning and 206.2 MB in the end (delta: -34.9 MB). Peak memory consumption was 554.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 25]: 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)=171, \old(a10)=175, \old(a12)=179, \old(a19)=172, \old(a4)=176, \old(inputB)=178, \old(inputC)=177, \old(inputD)=173, \old(inputE)=170, \old(inputF)=174, 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=6, 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)=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, 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)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L481] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L493] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L499] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L504] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L509] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L514] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L523] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L526] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L529] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L534] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L540] COND TRUE ((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0))) [L541] a1 = (((((a1 + -272193) - -47605) - -570122) % 89)+ 110) [L542] a10 = 1 [L544] return 25; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, \result=25, a1=169, a10=1, a12=0, a19=9, a4=14, input=6, 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=169, a10=1, a12=0, a19=9, a4=14, calculate_output(input)=25, input=6, 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=169, a10=1, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, 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)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a1=169, a10=1, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND TRUE ((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)))))) [L361] a1 = ((((a1 - 46038) + -455425) * 10)/ 9) [L362] a19 = 10 [L364] return 24; VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, \result=24, a1=-556993, a10=1, a12=0, a19=10, a4=14, input=4, 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=-556993, a10=1, a12=0, a19=10, a4=14, calculate_output(input)=24, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [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=-556993, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=24] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, 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)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=-556993, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND TRUE ((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0))) [L226] a1 = (((((a1 - 0) * 9)/ 10) % 25)- -12) [L227] a10 = 2 [L228] a19 = 8 [L230] return -1; VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, \result=-1, a1=-6, a10=2, 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=-6, a10=2, a12=0, a19=8, a4=14, calculate_output(input)=-1, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=24] [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=-6, a10=2, 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)=-6, \old(a10)=2, \old(a19)=8, \old(input)=4, a1=-6, a10=2, 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)=-6, \old(a10)=2, \old(a19)=8, \old(input)=4, a1=-6, a10=2, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND TRUE (((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)) VAL [\old(a1)=-6, \old(a10)=2, \old(a19)=8, \old(input)=4, a1=-6, a10=2, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L25] __VERIFIER_error() VAL [\old(a1)=-6, \old(a10)=2, \old(a19)=8, \old(input)=4, a1=-6, a10=2, 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, 59.5s OverallTime, 14 OverallIterations, 4 TraceHistogramMax, 49.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 755 SDtfs, 12775 SDslu, 1790 SDs, 0 SdLazy, 32273 SolverSat, 3929 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 31.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2321 GetRequests, 1999 SyntacticMatches, 12 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3792 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5886occurred in iteration=13, 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: 1.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 3534 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 4677 NumberOfCodeBlocks, 4677 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 4332 ConstructedInterpolants, 16 QuantifiedInterpolants, 7258898 SizeOfPredicates, 11 NumberOfNonLiveVariables, 3264 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 20 InterpolantComputations, 8 PerfectInterpolantSequences, 2044/2612 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...