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_label41_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 16:09:58,389 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 16:09:58,391 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 16:09:58,403 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 16:09:58,403 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 16:09:58,404 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 16:09:58,406 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 16:09:58,407 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 16:09:58,409 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 16:09:58,410 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 16:09:58,411 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 16:09:58,411 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 16:09:58,412 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 16:09:58,413 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 16:09:58,414 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 16:09:58,415 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 16:09:58,416 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 16:09:58,418 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 16:09:58,420 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 16:09:58,421 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 16:09:58,423 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 16:09:58,424 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 16:09:58,426 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 16:09:58,427 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 16:09:58,427 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 16:09:58,428 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 16:09:58,429 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 16:09:58,430 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 16:09:58,431 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 16:09:58,432 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 16:09:58,432 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 16:09:58,433 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 16:09:58,433 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 16:09:58,433 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 16:09:58,434 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 16:09:58,435 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 16:09:58,436 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:09:58,451 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 16:09:58,451 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 16:09:58,452 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 16:09:58,453 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 16:09:58,453 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 16:09:58,453 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 16:09:58,453 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 16:09:58,453 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 16:09:58,453 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 16:09:58,454 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 16:09:58,454 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 16:09:58,454 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 16:09:58,454 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 16:09:58,455 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 16:09:58,455 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 16:09:58,455 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 16:09:58,455 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 16:09:58,456 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 16:09:58,456 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 16:09:58,456 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 16:09:58,456 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 16:09:58,456 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 16:09:58,456 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 16:09:58,457 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 16:09:58,457 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 16:09:58,457 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 16:09:58,457 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 16:09:58,457 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 16:09:58,458 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 16:09:58,458 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 16:09:58,458 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 16:09:58,458 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 16:09:58,458 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 16:09:58,459 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 16:09:58,459 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 16:09:58,502 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 16:09:58,515 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 16:09:58,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 16:09:58,520 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 16:09:58,520 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 16:09:58,521 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label41_false-unreach-call.c [2018-11-12 16:09:58,576 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/438977461/e88dfe6f91e743bf9fcdf9733058bbcb/FLAGbf50ba576 [2018-11-12 16:09:59,133 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 16:09:59,134 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label41_false-unreach-call.c [2018-11-12 16:09:59,157 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/438977461/e88dfe6f91e743bf9fcdf9733058bbcb/FLAGbf50ba576 [2018-11-12 16:09:59,177 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/438977461/e88dfe6f91e743bf9fcdf9733058bbcb [2018-11-12 16:09:59,188 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 16:09:59,189 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 16:09:59,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 16:09:59,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 16:09:59,194 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 16:09:59,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:09:59" (1/1) ... [2018-11-12 16:09:59,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@140a0bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:59, skipping insertion in model container [2018-11-12 16:09:59,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:09:59" (1/1) ... [2018-11-12 16:09:59,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 16:09:59,261 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 16:09:59,691 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 16:09:59,695 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 16:09:59,798 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 16:09:59,814 INFO L193 MainTranslator]: Completed translation [2018-11-12 16:09:59,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:59 WrapperNode [2018-11-12 16:09:59,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 16:09:59,816 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 16:09:59,816 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 16:09:59,816 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 16:09:59,826 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:09:59" (1/1) ... [2018-11-12 16:09:59,927 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:09:59" (1/1) ... [2018-11-12 16:09:59,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 16:09:59,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 16:09:59,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 16:09:59,938 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 16:09:59,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:59" (1/1) ... [2018-11-12 16:09:59,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:59" (1/1) ... [2018-11-12 16:09:59,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:59" (1/1) ... [2018-11-12 16:09:59,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:59" (1/1) ... [2018-11-12 16:09:59,995 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:59" (1/1) ... [2018-11-12 16:10:00,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:59" (1/1) ... [2018-11-12 16:10:00,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:59" (1/1) ... [2018-11-12 16:10:00,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 16:10:00,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 16:10:00,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 16:10:00,042 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 16:10:00,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:59" (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:00,112 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 16:10:00,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 16:10:00,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 16:10:00,113 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 16:10:00,113 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 16:10:00,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 16:10:00,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 16:10:00,113 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 16:10:00,114 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 16:10:03,094 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 16:10:03,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:10:03 BoogieIcfgContainer [2018-11-12 16:10:03,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 16:10:03,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 16:10:03,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 16:10:03,100 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 16:10:03,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:09:59" (1/3) ... [2018-11-12 16:10:03,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a23caa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:10:03, skipping insertion in model container [2018-11-12 16:10:03,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:09:59" (2/3) ... [2018-11-12 16:10:03,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a23caa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:10:03, skipping insertion in model container [2018-11-12 16:10:03,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:10:03" (3/3) ... [2018-11-12 16:10:03,104 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label41_false-unreach-call.c [2018-11-12 16:10:03,112 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 16:10:03,122 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 16:10:03,140 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 16:10:03,181 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 16:10:03,182 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 16:10:03,182 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 16:10:03,182 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 16:10:03,182 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 16:10:03,184 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 16:10:03,184 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 16:10:03,184 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 16:10:03,214 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-12 16:10:03,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-12 16:10:03,225 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:10:03,229 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:10:03,234 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:10:03,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:10:03,241 INFO L82 PathProgramCache]: Analyzing trace with hash 531161921, now seen corresponding path program 1 times [2018-11-12 16:10:03,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:10:03,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:03,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:10:03,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:03,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:10:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:10:03,667 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 16:10:03,692 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:03,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:10:03,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 16:10:03,696 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:10:03,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 16:10:03,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 16:10:03,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 16:10:03,718 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-11-12 16:10:05,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:10:05,917 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-11-12 16:10:05,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 16:10:05,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-12 16:10:05,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:10:05,940 INFO L225 Difference]: With dead ends: 574 [2018-11-12 16:10:05,940 INFO L226 Difference]: Without dead ends: 356 [2018-11-12 16:10:05,948 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:05,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-12 16:10:06,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-11-12 16:10:06,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-12 16:10:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 609 transitions. [2018-11-12 16:10:06,043 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 609 transitions. Word has length 27 [2018-11-12 16:10:06,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:10:06,044 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 609 transitions. [2018-11-12 16:10:06,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 16:10:06,045 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 609 transitions. [2018-11-12 16:10:06,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-12 16:10:06,052 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:10:06,052 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:10:06,053 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:10:06,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:10:06,053 INFO L82 PathProgramCache]: Analyzing trace with hash 130424032, now seen corresponding path program 1 times [2018-11-12 16:10:06,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:10:06,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:06,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:10:06,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:06,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:10:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:10:06,378 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:10:06,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:10:06,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 16:10:06,379 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:10:06,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 16:10:06,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 16:10:06,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 16:10:06,382 INFO L87 Difference]: Start difference. First operand 356 states and 609 transitions. Second operand 6 states. [2018-11-12 16:10:08,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:10:08,241 INFO L93 Difference]: Finished difference Result 867 states and 1507 transitions. [2018-11-12 16:10:08,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 16:10:08,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2018-11-12 16:10:08,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:10:08,248 INFO L225 Difference]: With dead ends: 867 [2018-11-12 16:10:08,248 INFO L226 Difference]: Without dead ends: 517 [2018-11-12 16:10:08,251 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:08,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-11-12 16:10:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 508. [2018-11-12 16:10:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-11-12 16:10:08,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 831 transitions. [2018-11-12 16:10:08,293 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 831 transitions. Word has length 101 [2018-11-12 16:10:08,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:10:08,294 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 831 transitions. [2018-11-12 16:10:08,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 16:10:08,294 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 831 transitions. [2018-11-12 16:10:08,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-12 16:10:08,298 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:10:08,298 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:10:08,298 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:10:08,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:10:08,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1594427148, now seen corresponding path program 1 times [2018-11-12 16:10:08,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:10:08,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:08,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:10:08,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:08,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:10:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:10:08,563 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 16:10:08,642 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:10:08,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:10:08,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:10:08,644 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2018-11-12 16:10:08,646 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [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], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 16:10:08,721 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:10:08,722 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:10:09,384 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:10:10,442 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 16:10:10,444 INFO L272 AbstractInterpreter]: Visited 88 different actions 497 times. Merged at 5 different actions 25 times. Widened at 1 different actions 1 times. Performed 4929 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4929 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 16:10:10,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:10:10,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 16:10:10,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:10:10,493 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:10,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:10:10,510 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:10:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:10:10,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:10:10,797 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:10:10,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 16:10:11,308 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:10:11,344 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 16:10:11,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8 [2018-11-12 16:10:11,344 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:10:11,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 16:10:11,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 16:10:11,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-12 16:10:11,348 INFO L87 Difference]: Start difference. First operand 508 states and 831 transitions. Second operand 3 states. [2018-11-12 16:10:12,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:10:12,988 INFO L93 Difference]: Finished difference Result 1448 states and 2464 transitions. [2018-11-12 16:10:12,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 16:10:12,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-11-12 16:10:12,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:10:12,996 INFO L225 Difference]: With dead ends: 1448 [2018-11-12 16:10:12,996 INFO L226 Difference]: Without dead ends: 946 [2018-11-12 16:10:13,000 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 213 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-12 16:10:13,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2018-11-12 16:10:13,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 946. [2018-11-12 16:10:13,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2018-11-12 16:10:13,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1566 transitions. [2018-11-12 16:10:13,043 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1566 transitions. Word has length 107 [2018-11-12 16:10:13,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:10:13,044 INFO L480 AbstractCegarLoop]: Abstraction has 946 states and 1566 transitions. [2018-11-12 16:10:13,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 16:10:13,044 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1566 transitions. [2018-11-12 16:10:13,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-12 16:10:13,053 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:10:13,053 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,055 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:10:13,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:10:13,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1936086969, now seen corresponding path program 1 times [2018-11-12 16:10:13,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:10:13,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:13,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:10:13,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:13,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:10:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:10:13,413 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 16:10:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:10:13,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:10:13,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 16:10:13,820 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:10:13,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 16:10:13,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 16:10:13,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 16:10:13,823 INFO L87 Difference]: Start difference. First operand 946 states and 1566 transitions. Second operand 6 states. [2018-11-12 16:10:17,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:10:17,152 INFO L93 Difference]: Finished difference Result 2484 states and 4235 transitions. [2018-11-12 16:10:17,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 16:10:17,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2018-11-12 16:10:17,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:10:17,173 INFO L225 Difference]: With dead ends: 2484 [2018-11-12 16:10:17,173 INFO L226 Difference]: Without dead ends: 1544 [2018-11-12 16:10:17,182 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 16:10:17,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2018-11-12 16:10:17,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1515. [2018-11-12 16:10:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2018-11-12 16:10:17,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2291 transitions. [2018-11-12 16:10:17,254 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2291 transitions. Word has length 140 [2018-11-12 16:10:17,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:10:17,255 INFO L480 AbstractCegarLoop]: Abstraction has 1515 states and 2291 transitions. [2018-11-12 16:10:17,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 16:10:17,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2291 transitions. [2018-11-12 16:10:17,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-12 16:10:17,260 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:10:17,261 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,262 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:10:17,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:10:17,263 INFO L82 PathProgramCache]: Analyzing trace with hash 625958776, now seen corresponding path program 1 times [2018-11-12 16:10:17,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:10:17,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:17,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:10:17,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:17,264 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:10:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:10:17,793 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:10:17,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:10:17,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 16:10:17,794 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:10:17,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 16:10:17,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 16:10:17,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 16:10:17,796 INFO L87 Difference]: Start difference. First operand 1515 states and 2291 transitions. Second operand 5 states. [2018-11-12 16:10:18,012 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-11-12 16:10:19,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:10:19,974 INFO L93 Difference]: Finished difference Result 4153 states and 6381 transitions. [2018-11-12 16:10:19,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 16:10:19,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2018-11-12 16:10:19,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:10:19,993 INFO L225 Difference]: With dead ends: 4153 [2018-11-12 16:10:19,993 INFO L226 Difference]: Without dead ends: 2644 [2018-11-12 16:10:20,005 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-12 16:10:20,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2018-11-12 16:10:20,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 2402. [2018-11-12 16:10:20,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2402 states. [2018-11-12 16:10:20,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 2402 states and 3561 transitions. [2018-11-12 16:10:20,095 INFO L78 Accepts]: Start accepts. Automaton has 2402 states and 3561 transitions. Word has length 145 [2018-11-12 16:10:20,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:10:20,096 INFO L480 AbstractCegarLoop]: Abstraction has 2402 states and 3561 transitions. [2018-11-12 16:10:20,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 16:10:20,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2402 states and 3561 transitions. [2018-11-12 16:10:20,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-12 16:10:20,107 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:10:20,108 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,108 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:10:20,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:10:20,109 INFO L82 PathProgramCache]: Analyzing trace with hash 601760117, now seen corresponding path program 1 times [2018-11-12 16:10:20,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:10:20,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:20,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:10:20,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:20,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:10:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:10:20,378 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-11-12 16:10:20,570 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-12 16:10:20,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:10:20,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 16:10:20,571 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:10:20,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 16:10:20,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 16:10:20,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 16:10:20,576 INFO L87 Difference]: Start difference. First operand 2402 states and 3561 transitions. Second operand 3 states. [2018-11-12 16:10:22,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:10:22,165 INFO L93 Difference]: Finished difference Result 6226 states and 9670 transitions. [2018-11-12 16:10:22,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 16:10:22,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-11-12 16:10:22,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:10:22,189 INFO L225 Difference]: With dead ends: 6226 [2018-11-12 16:10:22,190 INFO L226 Difference]: Without dead ends: 4126 [2018-11-12 16:10:22,207 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 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:22,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4126 states. [2018-11-12 16:10:22,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4126 to 3648. [2018-11-12 16:10:22,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3648 states. [2018-11-12 16:10:22,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3648 states and 5206 transitions. [2018-11-12 16:10:22,317 INFO L78 Accepts]: Start accepts. Automaton has 3648 states and 5206 transitions. Word has length 211 [2018-11-12 16:10:22,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:10:22,317 INFO L480 AbstractCegarLoop]: Abstraction has 3648 states and 5206 transitions. [2018-11-12 16:10:22,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 16:10:22,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3648 states and 5206 transitions. [2018-11-12 16:10:22,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-12 16:10:22,332 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:10:22,333 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,333 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:10:22,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:10:22,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1097691914, now seen corresponding path program 1 times [2018-11-12 16:10:22,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:10:22,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:22,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:10:22,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:22,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:10:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:10:23,383 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:10:23,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:10:23,384 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:10:23,384 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-11-12 16:10:23,385 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [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], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [686], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 16:10:23,391 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:10:23,391 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:10:23,535 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:10:24,346 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 16:10:24,346 INFO L272 AbstractInterpreter]: Visited 126 different actions 366 times. Merged at 5 different actions 10 times. Never widened. Performed 6095 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6095 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 16:10:24,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:10:24,385 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 16:10:25,193 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 74.34% of their original sizes. [2018-11-12 16:10:25,193 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 16:10:26,324 INFO L415 sIntCurrentIteration]: We unified 215 AI predicates to 215 [2018-11-12 16:10:26,324 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 16:10:26,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 16:10:26,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [13] total 32 [2018-11-12 16:10:26,325 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:10:26,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 16:10:26,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 16:10:26,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-11-12 16:10:26,327 INFO L87 Difference]: Start difference. First operand 3648 states and 5206 transitions. Second operand 21 states. [2018-11-12 16:10:51,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:10:51,034 INFO L93 Difference]: Finished difference Result 7450 states and 10779 transitions. [2018-11-12 16:10:51,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 16:10:51,034 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 216 [2018-11-12 16:10:51,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:10:51,053 INFO L225 Difference]: With dead ends: 7450 [2018-11-12 16:10:51,053 INFO L226 Difference]: Without dead ends: 3808 [2018-11-12 16:10:51,070 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 226 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2018-11-12 16:10:51,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3808 states. [2018-11-12 16:10:51,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3808 to 3624. [2018-11-12 16:10:51,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3624 states. [2018-11-12 16:10:51,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 5099 transitions. [2018-11-12 16:10:51,164 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 5099 transitions. Word has length 216 [2018-11-12 16:10:51,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:10:51,165 INFO L480 AbstractCegarLoop]: Abstraction has 3624 states and 5099 transitions. [2018-11-12 16:10:51,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 16:10:51,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 5099 transitions. [2018-11-12 16:10:51,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-12 16:10:51,172 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:10:51,172 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 16:10:51,173 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:10:51,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:10:51,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1724187907, now seen corresponding path program 1 times [2018-11-12 16:10:51,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:10:51,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:51,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:10:51,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:51,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:10:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:10:51,455 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 16:10:52,212 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-12 16:10:52,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:10:52,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:10:52,213 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 226 with the following transitions: [2018-11-12 16:10:52,214 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [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], [686], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 16:10:52,219 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:10:52,220 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:10:52,301 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:10:52,924 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 16:10:52,925 INFO L272 AbstractInterpreter]: Visited 127 different actions 621 times. Merged at 7 different actions 31 times. Widened at 1 different actions 1 times. Performed 7898 root evaluator evaluations with a maximum evaluation depth of 6. Performed 7898 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 16:10:52,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:10:52,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 16:10:52,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:10:52,929 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:10:52,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:10:52,938 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:10:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:10:53,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:10:53,150 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 118 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:10:53,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 16:10:53,709 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 118 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:10:53,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 16:10:53,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2018-11-12 16:10:53,730 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 16:10:53,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 16:10:53,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 16:10:53,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-12 16:10:53,734 INFO L87 Difference]: Start difference. First operand 3624 states and 5099 transitions. Second operand 11 states. [2018-11-12 16:10:57,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:10:57,106 INFO L93 Difference]: Finished difference Result 8491 states and 12280 transitions. [2018-11-12 16:10:57,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-12 16:10:57,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 225 [2018-11-12 16:10:57,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:10:57,126 INFO L225 Difference]: With dead ends: 8491 [2018-11-12 16:10:57,126 INFO L226 Difference]: Without dead ends: 2396 [2018-11-12 16:10:57,155 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 454 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=169, Invalid=431, Unknown=0, NotChecked=0, Total=600 [2018-11-12 16:10:57,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2018-11-12 16:10:57,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1875. [2018-11-12 16:10:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2018-11-12 16:10:57,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2197 transitions. [2018-11-12 16:10:57,210 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2197 transitions. Word has length 225 [2018-11-12 16:10:57,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:10:57,215 INFO L480 AbstractCegarLoop]: Abstraction has 1875 states and 2197 transitions. [2018-11-12 16:10:57,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 16:10:57,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2197 transitions. [2018-11-12 16:10:57,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-12 16:10:57,221 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:10:57,221 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 16:10:57,222 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:10:57,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:10:57,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1086063627, now seen corresponding path program 1 times [2018-11-12 16:10:57,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:10:57,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:57,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:10:57,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:10:57,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:10:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:10:58,122 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 47 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:10:58,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:10:58,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:10:58,123 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 262 with the following transitions: [2018-11-12 16:10:58,124 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [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], [686], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 16:10:58,127 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:10:58,128 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:10:58,229 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:10:58,535 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 16:10:58,535 INFO L272 AbstractInterpreter]: Visited 127 different actions 373 times. Merged at 7 different actions 16 times. Never widened. Performed 5190 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5190 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 16:10:58,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:10:58,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 16:10:58,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:10:58,566 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:10:58,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:10:58,585 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:10:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:10:58,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:11:19,324 WARN L179 SmtUtils]: Spent 20.18 s on a formula simplification. DAG size of input: 95 DAG size of output: 52 [2018-11-12 16:11:20,373 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 123 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:11:20,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 16:11:32,427 WARN L179 SmtUtils]: Spent 10.83 s on a formula simplification. DAG size of input: 416 DAG size of output: 22 [2018-11-12 16:11:33,084 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-12 16:11:33,090 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-12 16:11:33,221 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 26 [2018-11-12 16:11:33,518 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2018-11-12 16:11:33,522 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:33,581 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:33,641 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:33,739 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:33,807 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:33,929 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:34,152 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:34,213 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:34,268 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:34,319 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:34,450 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:34,533 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:34,588 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:34,648 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:34,700 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:34,752 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:34,850 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:34,938 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:35,017 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:35,080 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:35,133 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:35,500 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:35,551 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:35,682 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:35,791 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:35,846 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:35,898 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:35,951 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:36,372 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:36,801 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:37,264 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:37,561 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:37,613 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:37,662 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:38,085 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:38,524 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:38,964 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:39,256 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:39,308 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:39,359 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:39,413 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:39,482 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:39,544 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:39,600 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:39,664 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:39,817 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:39,869 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:39,937 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:39,991 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:40,048 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:40,098 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:40,149 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:40,572 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:40,739 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:40,789 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:40,841 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:41,271 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:41,471 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:41,523 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:41,575 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:41,624 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:41,674 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:41,725 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:41,774 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:41,824 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:41,877 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:41,928 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:42,020 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:42,079 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:42,143 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:42,203 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:42,298 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:42,367 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:42,437 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:42,508 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:42,558 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:42,608 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:42,660 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:42,714 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:42,844 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:42,902 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:42,957 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:43,008 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:43,062 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:43,112 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:43,551 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:43,981 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:44,150 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:44,204 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:44,256 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:44,307 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:44,357 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:44,407 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:44,457 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:44,531 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:44,581 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:44,630 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:44,722 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:44,773 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:44,824 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:44,875 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:45,232 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:45,281 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:45,335 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:45,385 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:45,437 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:45,486 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:45,536 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 16:11:46,108 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 45 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:11:46,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 16:11:46,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 28 [2018-11-12 16:11:46,129 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 16:11:46,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 16:11:46,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 16:11:46,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2018-11-12 16:11:46,130 INFO L87 Difference]: Start difference. First operand 1875 states and 2197 transitions. Second operand 21 states. [2018-11-12 16:11:49,998 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2018-11-12 16:12:01,517 WARN L179 SmtUtils]: Spent 6.19 s on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2018-11-12 16:12:02,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:12:02,263 INFO L93 Difference]: Finished difference Result 5385 states and 6536 transitions. [2018-11-12 16:12:02,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-12 16:12:02,263 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 261 [2018-11-12 16:12:02,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:12:02,276 INFO L225 Difference]: With dead ends: 5385 [2018-11-12 16:12:02,276 INFO L226 Difference]: Without dead ends: 3662 [2018-11-12 16:12:02,281 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 402 SyntacticMatches, 110 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3131 ImplicationChecksByTransitivity, 55.2s TimeCoverageRelationStatistics Valid=926, Invalid=3364, Unknown=0, NotChecked=0, Total=4290 [2018-11-12 16:12:02,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2018-11-12 16:12:02,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 2925. [2018-11-12 16:12:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2925 states. [2018-11-12 16:12:02,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 3451 transitions. [2018-11-12 16:12:02,364 INFO L78 Accepts]: Start accepts. Automaton has 2925 states and 3451 transitions. Word has length 261 [2018-11-12 16:12:02,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:12:02,365 INFO L480 AbstractCegarLoop]: Abstraction has 2925 states and 3451 transitions. [2018-11-12 16:12:02,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 16:12:02,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2925 states and 3451 transitions. [2018-11-12 16:12:02,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-11-12 16:12:02,373 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:12:02,374 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 16:12:02,374 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:12:02,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:12:02,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1554314, now seen corresponding path program 1 times [2018-11-12 16:12:02,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:12:02,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:12:02,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:12:02,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:12:02,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:12:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-12 16:12:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-12 16:12:02,574 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-12 16:12:02,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:12:02 BoogieIcfgContainer [2018-11-12 16:12:02,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 16:12:02,750 INFO L168 Benchmark]: Toolchain (without parser) took 123561.40 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.2 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 904.7 MB. Max. memory is 7.1 GB. [2018-11-12 16:12:02,751 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 16:12:02,752 INFO L168 Benchmark]: CACSL2BoogieTranslator took 625.02 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-12 16:12:02,753 INFO L168 Benchmark]: Boogie Procedure Inliner took 121.37 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -810.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-11-12 16:12:02,754 INFO L168 Benchmark]: Boogie Preprocessor took 103.72 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2018-11-12 16:12:02,755 INFO L168 Benchmark]: RCFGBuilder took 3053.16 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: 106.5 MB). Peak memory consumption was 106.5 MB. Max. memory is 7.1 GB. [2018-11-12 16:12:02,755 INFO L168 Benchmark]: TraceAbstraction took 119653.28 ms. Allocated memory was 2.2 GB in the beginning and 3.7 GB in the end (delta: 1.5 GB). Free memory was 2.1 GB in the beginning and 2.7 GB in the end (delta: -649.4 MB). Peak memory consumption was 839.0 MB. Max. memory is 7.1 GB. [2018-11-12 16:12:02,760 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 625.02 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 121.37 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -810.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 103.72 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3053.16 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: 106.5 MB). Peak memory consumption was 106.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 119653.28 ms. Allocated memory was 2.2 GB in the beginning and 3.7 GB in the end (delta: 1.5 GB). Free memory was 2.1 GB in the beginning and 2.7 GB in the end (delta: -649.4 MB). Peak memory consumption was 839.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 64]: 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)=518106, \old(a10)=518110, \old(a12)=518114, \old(a19)=518107, \old(a4)=518111, \old(inputB)=518113, \old(inputC)=518112, \old(inputD)=518108, \old(inputE)=518105, \old(inputF)=518109, 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=2, 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)=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L526] COND TRUE ((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0))))) [L527] a1 = (((a1 * 5) + 278443) - -239546) [L528] RET return 26; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, \result=26, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, 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=518104, a10=0, a12=0, a19=9, a4=14, calculate_output(input)=26, input=2, 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=518104, a10=0, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=26] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND TRUE ((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14))) [L437] a1 = (((((a1 / 5) % 89)- -128) / 5) + 34) [L438] a10 = 0 [L439] a19 = 8 [L441] RET return -1; VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, \result=-1, a1=64, a10=0, a12=0, a19=8, 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=64, a10=0, a12=0, a19=8, a4=14, calculate_output(input)=-1, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=26] [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=64, a10=0, a12=0, a19=8, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] CALL calculate_output(input) VAL [\old(a1)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, 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)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, 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)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, 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)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, 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)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, 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)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, 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)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, 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)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, 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)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, 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)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, 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)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, 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)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, 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)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, 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)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, 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)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND TRUE (((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)) VAL [\old(a1)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] __VERIFIER_error() VAL [\old(a1)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, 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, 119.5s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 57.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1369 SDtfs, 8798 SDslu, 1382 SDs, 0 SdLazy, 12897 SolverSat, 2704 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 24.7s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1546 GetRequests, 1277 SyntacticMatches, 125 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3510 ImplicationChecksByTransitivity, 60.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3648occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.0s AbstIntTime, 4 AbstIntIterations, 1 AbstIntStrong, 0.996572557876906 AbsIntWeakeningRatio, 0.12093023255813953 AbsIntAvgWeakeningVarsNumRemoved, 16.25581395348837 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 2200 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 53.5s InterpolantComputationTime, 2306 NumberOfCodeBlocks, 2306 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2604 ConstructedInterpolants, 126 QuantifiedInterpolants, 7553425 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1082 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 897/1170 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...