java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label48_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 16:10:26,461 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 16:10:26,464 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 16:10:26,476 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 16:10:26,476 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 16:10:26,477 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 16:10:26,478 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 16:10:26,480 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 16:10:26,482 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 16:10:26,482 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 16:10:26,483 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 16:10:26,484 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 16:10:26,485 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 16:10:26,486 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 16:10:26,487 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 16:10:26,488 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 16:10:26,488 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 16:10:26,490 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 16:10:26,492 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 16:10:26,494 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 16:10:26,495 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 16:10:26,496 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 16:10:26,499 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 16:10:26,499 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 16:10:26,499 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 16:10:26,500 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 16:10:26,501 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 16:10:26,502 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 16:10:26,503 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 16:10:26,504 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 16:10:26,504 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 16:10:26,505 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 16:10:26,505 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 16:10:26,505 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 16:10:26,506 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 16:10:26,507 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 16:10:26,507 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 16:10:26,534 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 16:10:26,535 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 16:10:26,537 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 16:10:26,538 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 16:10:26,538 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 16:10:26,538 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 16:10:26,538 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 16:10:26,539 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 16:10:26,539 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 16:10:26,539 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 16:10:26,539 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 16:10:26,539 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 16:10:26,539 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 16:10:26,544 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 16:10:26,544 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 16:10:26,544 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 16:10:26,544 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 16:10:26,544 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 16:10:26,545 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 16:10:26,545 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 16:10:26,545 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 16:10:26,545 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 16:10:26,545 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 16:10:26,545 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 16:10:26,547 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 16:10:26,548 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 16:10:26,548 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 16:10:26,548 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 16:10:26,548 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 16:10:26,548 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 16:10:26,550 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 16:10:26,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 16:10:26,550 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 16:10:26,551 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 16:10:26,551 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 16:10:26,619 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 16:10:26,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 16:10:26,638 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 16:10:26,640 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 16:10:26,640 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 16:10:26,641 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label48_false-unreach-call.c [2018-11-12 16:10:26,707 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/499eed102/e1375d88977047b88806d3529cdb3834/FLAGc04de4e07 [2018-11-12 16:10:27,209 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 16:10:27,210 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label48_false-unreach-call.c [2018-11-12 16:10:27,224 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/499eed102/e1375d88977047b88806d3529cdb3834/FLAGc04de4e07 [2018-11-12 16:10:27,242 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/499eed102/e1375d88977047b88806d3529cdb3834 [2018-11-12 16:10:27,258 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 16:10:27,260 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 16:10:27,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 16:10:27,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 16:10:27,269 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 16:10:27,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:10:27" (1/1) ... [2018-11-12 16:10:27,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60250aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:10:27, skipping insertion in model container [2018-11-12 16:10:27,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:10:27" (1/1) ... [2018-11-12 16:10:27,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 16:10:27,364 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 16:10:27,882 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 16:10:27,886 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 16:10:28,036 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 16:10:28,057 INFO L193 MainTranslator]: Completed translation [2018-11-12 16:10:28,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:10:28 WrapperNode [2018-11-12 16:10:28,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 16:10:28,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 16:10:28,059 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 16:10:28,059 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 16:10:28,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:10:28" (1/1) ... [2018-11-12 16:10:28,215 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:10:28" (1/1) ... [2018-11-12 16:10:28,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 16:10:28,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 16:10:28,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 16:10:28,223 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 16:10:28,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:10:28" (1/1) ... [2018-11-12 16:10:28,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:10:28" (1/1) ... [2018-11-12 16:10:28,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:10:28" (1/1) ... [2018-11-12 16:10:28,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:10:28" (1/1) ... [2018-11-12 16:10:28,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:10:28" (1/1) ... [2018-11-12 16:10:28,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:10:28" (1/1) ... [2018-11-12 16:10:28,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:10:28" (1/1) ... [2018-11-12 16:10:28,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 16:10:28,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 16:10:28,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 16:10:28,347 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 16:10:28,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:10:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 16:10:28,420 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 16:10:28,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 16:10:28,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 16:10:28,420 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 16:10:28,421 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 16:10:28,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 16:10:28,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 16:10:28,422 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 16:10:28,422 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 16:10:31,428 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 16:10:31,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:10:31 BoogieIcfgContainer [2018-11-12 16:10:31,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 16:10:31,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 16:10:31,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 16:10:31,438 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 16:10:31,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:10:27" (1/3) ... [2018-11-12 16:10:31,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4faf216f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:10:31, skipping insertion in model container [2018-11-12 16:10:31,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:10:28" (2/3) ... [2018-11-12 16:10:31,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4faf216f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:10:31, skipping insertion in model container [2018-11-12 16:10:31,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:10:31" (3/3) ... [2018-11-12 16:10:31,446 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label48_false-unreach-call.c [2018-11-12 16:10:31,460 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 16:10:31,472 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 16:10:31,495 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 16:10:31,546 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 16:10:31,546 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 16:10:31,546 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 16:10:31,546 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 16:10:31,547 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 16:10:31,547 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 16:10:31,547 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 16:10:31,547 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 16:10:31,578 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-12 16:10:31,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-12 16:10:31,585 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:10:31,587 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:10:31,589 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:10:31,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:10:31,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1154570628, now seen corresponding path program 1 times [2018-11-12 16:10:31,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:10:31,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:31,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:10:31,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:31,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:10:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:10:31,944 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 16:10:31,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:10:31,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:10:31,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 16:10:31,963 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:10:31,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 16:10:31,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 16:10:31,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 16:10:31,985 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-11-12 16:10:33,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:10:33,970 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-11-12 16:10:33,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 16:10:33,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-12 16:10:33,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:10:33,992 INFO L225 Difference]: With dead ends: 574 [2018-11-12 16:10:33,992 INFO L226 Difference]: Without dead ends: 356 [2018-11-12 16:10:34,000 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 16:10:34,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-12 16:10:34,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-11-12 16:10:34,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-12 16:10:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 609 transitions. [2018-11-12 16:10:34,074 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 609 transitions. Word has length 14 [2018-11-12 16:10:34,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:10:34,075 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 609 transitions. [2018-11-12 16:10:34,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 16:10:34,076 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 609 transitions. [2018-11-12 16:10:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-12 16:10:34,081 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:10:34,081 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:10:34,082 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:10:34,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:10:34,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1906701860, now seen corresponding path program 1 times [2018-11-12 16:10:34,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:10:34,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:34,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:10:34,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:34,084 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:10:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:10:34,415 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:10:34,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:10:34,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 16:10:34,416 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:10:34,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 16:10:34,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 16:10:34,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 16:10:34,419 INFO L87 Difference]: Start difference. First operand 356 states and 609 transitions. Second operand 6 states. [2018-11-12 16:10:36,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:10:36,277 INFO L93 Difference]: Finished difference Result 867 states and 1507 transitions. [2018-11-12 16:10:36,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 16:10:36,279 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2018-11-12 16:10:36,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:10:36,285 INFO L225 Difference]: With dead ends: 867 [2018-11-12 16:10:36,285 INFO L226 Difference]: Without dead ends: 517 [2018-11-12 16:10:36,288 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 16:10:36,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-11-12 16:10:36,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 508. [2018-11-12 16:10:36,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-11-12 16:10:36,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 831 transitions. [2018-11-12 16:10:36,333 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 831 transitions. Word has length 88 [2018-11-12 16:10:36,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:10:36,334 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 831 transitions. [2018-11-12 16:10:36,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 16:10:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 831 transitions. [2018-11-12 16:10:36,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-12 16:10:36,339 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:10:36,339 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:10:36,339 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:10:36,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:10:36,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1339801912, now seen corresponding path program 1 times [2018-11-12 16:10:36,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:10:36,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:36,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:10:36,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:36,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:10:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:10:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:10:36,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:10:36,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 16:10:36,538 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:10:36,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 16:10:36,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 16:10:36,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 16:10:36,540 INFO L87 Difference]: Start difference. First operand 508 states and 831 transitions. Second operand 3 states. [2018-11-12 16:10:37,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:10:37,588 INFO L93 Difference]: Finished difference Result 1448 states and 2461 transitions. [2018-11-12 16:10:37,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 16:10:37,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-11-12 16:10:37,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:10:37,600 INFO L225 Difference]: With dead ends: 1448 [2018-11-12 16:10:37,600 INFO L226 Difference]: Without dead ends: 946 [2018-11-12 16:10:37,604 INFO L604 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 [2018-11-12 16:10:37,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2018-11-12 16:10:37,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 946. [2018-11-12 16:10:37,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2018-11-12 16:10:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1389 transitions. [2018-11-12 16:10:37,646 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1389 transitions. Word has length 94 [2018-11-12 16:10:37,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:10:37,647 INFO L480 AbstractCegarLoop]: Abstraction has 946 states and 1389 transitions. [2018-11-12 16:10:37,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 16:10:37,648 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1389 transitions. [2018-11-12 16:10:37,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-12 16:10:37,653 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:10:37,654 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:10:37,654 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:10:37,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:10:37,655 INFO L82 PathProgramCache]: Analyzing trace with hash -853444597, now seen corresponding path program 1 times [2018-11-12 16:10:37,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:10:37,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:37,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:10:37,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:37,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:10:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:10:37,955 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 16:10:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:10:38,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:10:38,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 16:10:38,102 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:10:38,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 16:10:38,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 16:10:38,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 16:10:38,104 INFO L87 Difference]: Start difference. First operand 946 states and 1389 transitions. Second operand 6 states. [2018-11-12 16:10:41,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:10:41,785 INFO L93 Difference]: Finished difference Result 2483 states and 3884 transitions. [2018-11-12 16:10:41,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 16:10:41,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-11-12 16:10:41,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:10:41,808 INFO L225 Difference]: With dead ends: 2483 [2018-11-12 16:10:41,809 INFO L226 Difference]: Without dead ends: 1543 [2018-11-12 16:10:41,816 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 16:10:41,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2018-11-12 16:10:41,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1524. [2018-11-12 16:10:41,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1524 states. [2018-11-12 16:10:41,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 2201 transitions. [2018-11-12 16:10:41,879 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 2201 transitions. Word has length 105 [2018-11-12 16:10:41,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:10:41,880 INFO L480 AbstractCegarLoop]: Abstraction has 1524 states and 2201 transitions. [2018-11-12 16:10:41,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 16:10:41,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 2201 transitions. [2018-11-12 16:10:41,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-12 16:10:41,887 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:10:41,888 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:10:41,888 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:10:41,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:10:41,893 INFO L82 PathProgramCache]: Analyzing trace with hash -245370561, now seen corresponding path program 1 times [2018-11-12 16:10:41,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:10:41,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:41,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:10:41,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:41,894 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:10:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:10:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:10:42,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:10:42,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 16:10:42,176 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:10:42,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 16:10:42,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 16:10:42,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 16:10:42,178 INFO L87 Difference]: Start difference. First operand 1524 states and 2201 transitions. Second operand 6 states. [2018-11-12 16:10:43,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:10:43,708 INFO L93 Difference]: Finished difference Result 3629 states and 5475 transitions. [2018-11-12 16:10:43,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 16:10:43,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-11-12 16:10:43,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:10:43,742 INFO L225 Difference]: With dead ends: 3629 [2018-11-12 16:10:43,743 INFO L226 Difference]: Without dead ends: 2111 [2018-11-12 16:10:43,754 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 16:10:43,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2018-11-12 16:10:43,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 2086. [2018-11-12 16:10:43,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2086 states. [2018-11-12 16:10:43,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 2931 transitions. [2018-11-12 16:10:43,832 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 2931 transitions. Word has length 127 [2018-11-12 16:10:43,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:10:43,832 INFO L480 AbstractCegarLoop]: Abstraction has 2086 states and 2931 transitions. [2018-11-12 16:10:43,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 16:10:43,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 2931 transitions. [2018-11-12 16:10:43,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-12 16:10:43,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:10:43,836 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:10:43,836 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:10:43,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:10:43,837 INFO L82 PathProgramCache]: Analyzing trace with hash 652649103, now seen corresponding path program 1 times [2018-11-12 16:10:43,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:10:43,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:43,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:10:43,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:43,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:10:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:10:44,121 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 16:10:44,560 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:10:44,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:10:44,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 16:10:44,561 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:10:44,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 16:10:44,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 16:10:44,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 16:10:44,562 INFO L87 Difference]: Start difference. First operand 2086 states and 2931 transitions. Second operand 6 states. [2018-11-12 16:10:46,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:10:46,165 INFO L93 Difference]: Finished difference Result 4447 states and 6252 transitions. [2018-11-12 16:10:46,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 16:10:46,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2018-11-12 16:10:46,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:10:46,188 INFO L225 Difference]: With dead ends: 4447 [2018-11-12 16:10:46,188 INFO L226 Difference]: Without dead ends: 2367 [2018-11-12 16:10:46,199 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 16:10:46,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2018-11-12 16:10:46,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2303. [2018-11-12 16:10:46,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2303 states. [2018-11-12 16:10:46,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 2993 transitions. [2018-11-12 16:10:46,267 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 2993 transitions. Word has length 151 [2018-11-12 16:10:46,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:10:46,267 INFO L480 AbstractCegarLoop]: Abstraction has 2303 states and 2993 transitions. [2018-11-12 16:10:46,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 16:10:46,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 2993 transitions. [2018-11-12 16:10:46,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-11-12 16:10:46,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:10:46,274 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:10:46,274 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:10:46,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:10:46,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1632298331, now seen corresponding path program 1 times [2018-11-12 16:10:46,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:10:46,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:46,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:10:46,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:46,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:10:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:10:46,617 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 16:10:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-12 16:10:46,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:10:46,804 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:10:46,805 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 232 with the following transitions: [2018-11-12 16:10:46,807 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [13], [15], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 16:10:46,859 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:10:46,860 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:10:47,414 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:10:49,809 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 16:10:49,815 INFO L272 AbstractInterpreter]: Visited 146 different actions 999 times. Merged at 7 different actions 46 times. Widened at 1 different actions 2 times. Performed 11564 root evaluator evaluations with a maximum evaluation depth of 6. Performed 11564 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 16:10:49,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:10:49,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 16:10:49,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:10:49,861 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2018-11-12 16:10:49,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:10:49,878 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:10:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:10:49,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:10:50,591 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 92 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:10:50,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 16:10:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 92 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:10:51,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 16:10:51,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2018-11-12 16:10:51,225 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 16:10:51,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 16:10:51,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 16:10:51,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-12 16:10:51,227 INFO L87 Difference]: Start difference. First operand 2303 states and 2993 transitions. Second operand 11 states. [2018-11-12 16:10:56,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:10:56,325 INFO L93 Difference]: Finished difference Result 5788 states and 7757 transitions. [2018-11-12 16:10:56,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-12 16:10:56,326 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 231 [2018-11-12 16:10:56,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:10:56,334 INFO L225 Difference]: With dead ends: 5788 [2018-11-12 16:10:56,334 INFO L226 Difference]: Without dead ends: 1773 [2018-11-12 16:10:56,351 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 466 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=169, Invalid=431, Unknown=0, NotChecked=0, Total=600 [2018-11-12 16:10:56,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2018-11-12 16:10:56,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1200. [2018-11-12 16:10:56,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1200 states. [2018-11-12 16:10:56,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1360 transitions. [2018-11-12 16:10:56,390 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1360 transitions. Word has length 231 [2018-11-12 16:10:56,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:10:56,391 INFO L480 AbstractCegarLoop]: Abstraction has 1200 states and 1360 transitions. [2018-11-12 16:10:56,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 16:10:56,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1360 transitions. [2018-11-12 16:10:56,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-12 16:10:56,395 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:10:56,396 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 16:10:56,396 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:10:56,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:10:56,396 INFO L82 PathProgramCache]: Analyzing trace with hash -98204353, now seen corresponding path program 1 times [2018-11-12 16:10:56,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:10:56,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:56,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:10:56,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:56,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:10:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:10:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 88 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:10:57,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:10:57,105 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:10:57,105 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 246 with the following transitions: [2018-11-12 16:10:57,106 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [13], [15], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [786], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 16:10:57,111 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:10:57,112 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:10:57,424 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 16:10:57,424 INFO L272 AbstractInterpreter]: Visited 148 different actions 148 times. Never merged. Never widened. Performed 2651 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2651 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Never found a fixpoint. Largest state had 24 variables. [2018-11-12 16:10:57,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:10:57,462 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 16:10:58,158 INFO L227 lantSequenceWeakener]: Weakened 223 states. On average, predicates are now at 72.75% of their original sizes. [2018-11-12 16:10:58,159 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 16:10:59,552 INFO L415 sIntCurrentIteration]: We unified 244 AI predicates to 244 [2018-11-12 16:10:59,553 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 16:10:59,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 16:10:59,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 25 [2018-11-12 16:10:59,554 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:10:59,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 16:10:59,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 16:10:59,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-12 16:10:59,555 INFO L87 Difference]: Start difference. First operand 1200 states and 1360 transitions. Second operand 13 states. [2018-11-12 16:11:05,866 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:11:14,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:11:14,199 INFO L93 Difference]: Finished difference Result 2255 states and 2560 transitions. [2018-11-12 16:11:14,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 16:11:14,199 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 245 [2018-11-12 16:11:14,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:11:14,203 INFO L225 Difference]: With dead ends: 2255 [2018-11-12 16:11:14,204 INFO L226 Difference]: Without dead ends: 1205 [2018-11-12 16:11:14,206 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 251 GetRequests, 171 SyntacticMatches, 62 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-11-12 16:11:14,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2018-11-12 16:11:14,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1200. [2018-11-12 16:11:14,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1200 states. [2018-11-12 16:11:14,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1340 transitions. [2018-11-12 16:11:14,235 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1340 transitions. Word has length 245 [2018-11-12 16:11:14,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:11:14,235 INFO L480 AbstractCegarLoop]: Abstraction has 1200 states and 1340 transitions. [2018-11-12 16:11:14,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 16:11:14,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1340 transitions. [2018-11-12 16:11:14,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-11-12 16:11:14,240 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:11:14,240 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 16:11:14,241 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:11:14,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:11:14,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1610977763, now seen corresponding path program 1 times [2018-11-12 16:11:14,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:11:14,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:11:14,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:11:14,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:11:14,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:11:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:11:14,709 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-12 16:11:14,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:11:14,709 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:11:14,709 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 268 with the following transitions: [2018-11-12 16:11:14,710 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [13], [15], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 16:11:14,714 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:11:14,715 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:11:14,860 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:11:15,674 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 16:11:15,674 INFO L272 AbstractInterpreter]: Visited 146 different actions 434 times. Merged at 7 different actions 20 times. Never widened. Performed 6098 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6098 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-12 16:11:15,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:11:15,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 16:11:15,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:11:15,712 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2018-11-12 16:11:15,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:11:15,738 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:11:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:11:15,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:11:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-11-12 16:11:16,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 16:11:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-11-12 16:11:16,270 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 16:11:16,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 11 [2018-11-12 16:11:16,270 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:11:16,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 16:11:16,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 16:11:16,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-12 16:11:16,272 INFO L87 Difference]: Start difference. First operand 1200 states and 1340 transitions. Second operand 3 states. [2018-11-12 16:11:16,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:11:16,976 INFO L93 Difference]: Finished difference Result 2831 states and 3167 transitions. [2018-11-12 16:11:16,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 16:11:16,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 267 [2018-11-12 16:11:16,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:11:16,983 INFO L225 Difference]: With dead ends: 2831 [2018-11-12 16:11:16,984 INFO L226 Difference]: Without dead ends: 1634 [2018-11-12 16:11:16,987 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 535 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-12 16:11:16,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2018-11-12 16:11:17,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1490. [2018-11-12 16:11:17,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2018-11-12 16:11:17,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1644 transitions. [2018-11-12 16:11:17,029 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1644 transitions. Word has length 267 [2018-11-12 16:11:17,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:11:17,030 INFO L480 AbstractCegarLoop]: Abstraction has 1490 states and 1644 transitions. [2018-11-12 16:11:17,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 16:11:17,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1644 transitions. [2018-11-12 16:11:17,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-11-12 16:11:17,037 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:11:17,038 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 16:11:17,038 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:11:17,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:11:17,038 INFO L82 PathProgramCache]: Analyzing trace with hash -524646333, now seen corresponding path program 1 times [2018-11-12 16:11:17,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:11:17,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:11:17,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:11:17,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:11:17,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:11:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:11:17,478 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 99 proven. 140 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 16:11:17,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:11:17,479 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:11:17,479 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 278 with the following transitions: [2018-11-12 16:11:17,479 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [13], [15], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 16:11:17,483 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:11:17,483 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:11:17,632 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:11:18,008 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 16:11:18,009 INFO L272 AbstractInterpreter]: Visited 126 different actions 494 times. Merged at 8 different actions 26 times. Never widened. Performed 6523 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6523 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 6 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 16:11:18,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:11:18,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 16:11:18,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:11:18,014 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2018-11-12 16:11:18,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:11:18,025 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:11:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:11:18,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:11:18,309 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 169 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-12 16:11:18,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 16:11:18,941 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 169 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-12 16:11:18,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 16:11:18,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 18 [2018-11-12 16:11:18,961 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 16:11:18,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-12 16:11:18,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-12 16:11:18,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-12 16:11:18,962 INFO L87 Difference]: Start difference. First operand 1490 states and 1644 transitions. Second operand 16 states. [2018-11-12 16:11:27,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:11:27,923 INFO L93 Difference]: Finished difference Result 4502 states and 5359 transitions. [2018-11-12 16:11:27,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-12 16:11:27,924 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 277 [2018-11-12 16:11:27,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:11:27,940 INFO L225 Difference]: With dead ends: 4502 [2018-11-12 16:11:27,940 INFO L226 Difference]: Without dead ends: 3015 [2018-11-12 16:11:27,948 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 584 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=749, Invalid=3541, Unknown=0, NotChecked=0, Total=4290 [2018-11-12 16:11:27,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2018-11-12 16:11:28,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 2801. [2018-11-12 16:11:28,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2801 states. [2018-11-12 16:11:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 3150 transitions. [2018-11-12 16:11:28,040 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 3150 transitions. Word has length 277 [2018-11-12 16:11:28,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:11:28,041 INFO L480 AbstractCegarLoop]: Abstraction has 2801 states and 3150 transitions. [2018-11-12 16:11:28,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-12 16:11:28,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 3150 transitions. [2018-11-12 16:11:28,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-11-12 16:11:28,048 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:11:28,049 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 16:11:28,049 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:11:28,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:11:28,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1872684776, now seen corresponding path program 1 times [2018-11-12 16:11:28,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:11:28,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:11:28,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:11:28,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:11:28,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:11:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:11:28,355 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 16:11:28,768 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 174 proven. 77 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 16:11:28,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:11:28,768 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:11:28,768 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 291 with the following transitions: [2018-11-12 16:11:28,769 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [13], [15], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [558], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 16:11:28,771 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:11:28,771 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:11:28,883 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:11:29,207 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 16:11:29,207 INFO L272 AbstractInterpreter]: Visited 126 different actions 494 times. Merged at 8 different actions 26 times. Never widened. Performed 6507 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6507 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 6 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 16:11:29,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:11:29,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 16:11:29,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:11:29,243 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2018-11-12 16:11:29,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:11:29,257 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:11:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:11:29,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:11:29,841 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 25 [2018-11-12 16:11:30,045 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 170 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-12 16:11:30,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 16:11:30,327 WARN L179 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2018-11-12 16:11:31,209 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 170 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-12 16:11:31,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 16:11:31,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 17 [2018-11-12 16:11:31,230 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 16:11:31,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 16:11:31,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 16:11:31,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-11-12 16:11:31,231 INFO L87 Difference]: Start difference. First operand 2801 states and 3150 transitions. Second operand 15 states. [2018-11-12 16:11:38,193 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2018-11-12 16:11:40,432 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2018-11-12 16:11:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:11:40,601 INFO L93 Difference]: Finished difference Result 5785 states and 6589 transitions. [2018-11-12 16:11:40,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-12 16:11:40,601 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 290 [2018-11-12 16:11:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:11:40,616 INFO L225 Difference]: With dead ends: 5785 [2018-11-12 16:11:40,617 INFO L226 Difference]: Without dead ends: 3422 [2018-11-12 16:11:40,625 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 606 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 908 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=594, Invalid=2598, Unknown=0, NotChecked=0, Total=3192 [2018-11-12 16:11:40,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3422 states. [2018-11-12 16:11:40,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3422 to 3260. [2018-11-12 16:11:40,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3260 states. [2018-11-12 16:11:40,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3260 states to 3260 states and 3681 transitions. [2018-11-12 16:11:40,732 INFO L78 Accepts]: Start accepts. Automaton has 3260 states and 3681 transitions. Word has length 290 [2018-11-12 16:11:40,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:11:40,733 INFO L480 AbstractCegarLoop]: Abstraction has 3260 states and 3681 transitions. [2018-11-12 16:11:40,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 16:11:40,733 INFO L276 IsEmpty]: Start isEmpty. Operand 3260 states and 3681 transitions. [2018-11-12 16:11:40,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-11-12 16:11:40,743 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:11:40,743 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 16:11:40,744 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:11:40,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:11:40,744 INFO L82 PathProgramCache]: Analyzing trace with hash 599679060, now seen corresponding path program 1 times [2018-11-12 16:11:40,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:11:40,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:11:40,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:11:40,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:11:40,745 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:11:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:11:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 149 proven. 100 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 16:11:41,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:11:41,556 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:11:41,556 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 309 with the following transitions: [2018-11-12 16:11:41,557 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [13], [15], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [542], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [766], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 16:11:41,559 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:11:41,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:11:41,732 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:11:42,740 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 16:11:42,740 INFO L272 AbstractInterpreter]: Visited 148 different actions 875 times. Merged at 8 different actions 46 times. Widened at 1 different actions 1 times. Performed 11748 root evaluator evaluations with a maximum evaluation depth of 6. Performed 11748 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 10 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 16:11:42,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:11:42,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 16:11:42,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:11:42,747 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2018-11-12 16:11:42,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:11:42,756 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:11:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:11:42,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:11:43,630 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 23 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:11:43,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 16:11:44,364 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 173 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:11:44,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 16:11:44,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 8] total 28 [2018-11-12 16:11:44,386 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 16:11:44,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-12 16:11:44,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-12 16:11:44,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2018-11-12 16:11:44,390 INFO L87 Difference]: Start difference. First operand 3260 states and 3681 transitions. Second operand 23 states. [2018-11-12 16:11:47,266 WARN L179 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2018-11-12 16:11:47,497 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2018-11-12 16:11:53,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:11:53,010 INFO L93 Difference]: Finished difference Result 8158 states and 9650 transitions. [2018-11-12 16:11:53,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-12 16:11:53,010 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 308 [2018-11-12 16:11:53,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:11:53,034 INFO L225 Difference]: With dead ends: 8158 [2018-11-12 16:11:53,034 INFO L226 Difference]: Without dead ends: 5336 [2018-11-12 16:11:53,045 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 611 SyntacticMatches, 8 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=889, Invalid=3533, Unknown=0, NotChecked=0, Total=4422 [2018-11-12 16:11:53,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5336 states. [2018-11-12 16:11:53,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5336 to 4881. [2018-11-12 16:11:53,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4881 states. [2018-11-12 16:11:53,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4881 states to 4881 states and 5549 transitions. [2018-11-12 16:11:53,225 INFO L78 Accepts]: Start accepts. Automaton has 4881 states and 5549 transitions. Word has length 308 [2018-11-12 16:11:53,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:11:53,226 INFO L480 AbstractCegarLoop]: Abstraction has 4881 states and 5549 transitions. [2018-11-12 16:11:53,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-12 16:11:53,226 INFO L276 IsEmpty]: Start isEmpty. Operand 4881 states and 5549 transitions. [2018-11-12 16:11:53,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-11-12 16:11:53,240 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:11:53,241 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2018-11-12 16:11:53,241 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:11:53,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:11:53,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1790886515, now seen corresponding path program 1 times [2018-11-12 16:11:53,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:11:53,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:11:53,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:11:53,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:11:53,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:11:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-12 16:11:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-12 16:11:53,421 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-12 16:11:53,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:11:53 BoogieIcfgContainer [2018-11-12 16:11:53,596 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 16:11:53,597 INFO L168 Benchmark]: Toolchain (without parser) took 86338.26 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 3.6 GB in the end (delta: -2.1 GB). Peak memory consumption was 326.5 MB. Max. memory is 7.1 GB. [2018-11-12 16:11:53,598 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 16:11:53,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 793.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2018-11-12 16:11:53,599 INFO L168 Benchmark]: Boogie Procedure Inliner took 164.13 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 708.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.6 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2018-11-12 16:11:53,600 INFO L168 Benchmark]: Boogie Preprocessor took 123.00 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 16:11:53,601 INFO L168 Benchmark]: RCFGBuilder took 3086.75 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 109.4 MB). Peak memory consumption was 109.4 MB. Max. memory is 7.1 GB. [2018-11-12 16:11:53,602 INFO L168 Benchmark]: TraceAbstraction took 82161.98 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 259.4 MB. Max. memory is 7.1 GB. [2018-11-12 16:11:53,606 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 793.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 164.13 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 708.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.6 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.00 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3086.75 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 109.4 MB). Peak memory consumption was 109.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 82161.98 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 259.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] RET 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] 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] RET 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] 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] RET 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] 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=6, 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)=6, 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)=6, a1=-6, a10=2, a12=0, a19=8, a4=14, input=6, 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)=6, a1=-6, a10=2, a12=0, a19=8, a4=14, input=6, 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)=6, a1=-6, a10=2, a12=0, a19=8, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNSAFE Result, 82.0s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 59.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1374 SDtfs, 14629 SDslu, 1791 SDs, 0 SdLazy, 26306 SolverSat, 4185 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 35.8s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 3338 GetRequests, 2986 SyntacticMatches, 88 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3787 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4881occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.6s AbstIntTime, 6 AbstIntIterations, 1 AbstIntStrong, 0.997692676176283 AbsIntWeakeningRatio, 0.10655737704918032 AbsIntAvgWeakeningVarsNumRemoved, 1.2704918032786885 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 1670 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 3899 NumberOfCodeBlocks, 3899 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4921 ConstructedInterpolants, 12 QuantifiedInterpolants, 8743256 SizeOfPredicates, 10 NumberOfNonLiveVariables, 2360 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 22 InterpolantComputations, 8 PerfectInterpolantSequences, 2382/3050 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...