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_label42_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 17:41:50,387 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 17:41:50,389 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 17:41:50,402 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 17:41:50,402 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 17:41:50,403 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 17:41:50,405 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 17:41:50,407 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 17:41:50,408 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 17:41:50,409 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 17:41:50,410 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 17:41:50,411 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 17:41:50,412 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 17:41:50,412 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 17:41:50,414 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 17:41:50,415 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 17:41:50,415 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 17:41:50,417 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 17:41:50,420 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 17:41:50,421 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 17:41:50,423 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 17:41:50,424 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 17:41:50,426 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 17:41:50,426 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 17:41:50,427 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 17:41:50,428 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 17:41:50,429 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 17:41:50,430 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 17:41:50,431 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 17:41:50,432 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 17:41:50,432 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 17:41:50,433 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 17:41:50,433 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 17:41:50,433 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 17:41:50,434 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 17:41:50,435 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 17:41:50,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-07 17:41:50,451 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 17:41:50,451 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 17:41:50,452 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 17:41:50,452 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 17:41:50,455 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 17:41:50,455 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 17:41:50,455 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 17:41:50,455 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 17:41:50,456 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 17:41:50,456 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 17:41:50,456 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 17:41:50,456 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 17:41:50,456 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 17:41:50,457 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 17:41:50,457 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 17:41:50,457 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 17:41:50,460 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 17:41:50,460 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 17:41:50,460 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 17:41:50,460 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 17:41:50,460 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 17:41:50,461 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 17:41:50,461 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 17:41:50,461 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 17:41:50,461 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 17:41:50,461 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 17:41:50,462 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 17:41:50,462 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 17:41:50,462 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 17:41:50,462 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 17:41:50,462 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 17:41:50,462 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 17:41:50,463 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 17:41:50,463 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 17:41:50,463 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 17:41:50,508 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 17:41:50,523 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 17:41:50,528 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 17:41:50,529 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 17:41:50,530 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 17:41:50,531 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label42_false-unreach-call.c [2018-11-07 17:41:50,596 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0000c2a3/b9081ce533cf4916b9a107dbacd76ee8/FLAG94cb37e89 [2018-11-07 17:41:51,224 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 17:41:51,225 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label42_false-unreach-call.c [2018-11-07 17:41:51,236 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0000c2a3/b9081ce533cf4916b9a107dbacd76ee8/FLAG94cb37e89 [2018-11-07 17:41:51,252 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0000c2a3/b9081ce533cf4916b9a107dbacd76ee8 [2018-11-07 17:41:51,263 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 17:41:51,264 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 17:41:51,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 17:41:51,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 17:41:51,270 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 17:41:51,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:41:51" (1/1) ... [2018-11-07 17:41:51,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a0c593d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:41:51, skipping insertion in model container [2018-11-07 17:41:51,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:41:51" (1/1) ... [2018-11-07 17:41:51,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 17:41:51,336 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 17:41:51,833 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 17:41:51,838 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 17:41:51,952 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 17:41:51,972 INFO L193 MainTranslator]: Completed translation [2018-11-07 17:41:51,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:41:51 WrapperNode [2018-11-07 17:41:51,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 17:41:51,973 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 17:41:51,973 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 17:41:51,974 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 17:41:51,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:41:51" (1/1) ... [2018-11-07 17:41:52,096 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:41:51" (1/1) ... [2018-11-07 17:41:52,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 17:41:52,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 17:41:52,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 17:41:52,105 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 17:41:52,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:41:51" (1/1) ... [2018-11-07 17:41:52,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:41:51" (1/1) ... [2018-11-07 17:41:52,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:41:51" (1/1) ... [2018-11-07 17:41:52,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:41:51" (1/1) ... [2018-11-07 17:41:52,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:41:51" (1/1) ... [2018-11-07 17:41:52,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:41:51" (1/1) ... [2018-11-07 17:41:52,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:41:51" (1/1) ... [2018-11-07 17:41:52,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 17:41:52,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 17:41:52,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 17:41:52,196 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 17:41:52,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:41:51" (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-07 17:41:52,267 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 17:41:52,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 17:41:52,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 17:41:52,267 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 17:41:52,268 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 17:41:52,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 17:41:52,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 17:41:52,268 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 17:41:52,268 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 17:41:55,395 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 17:41:55,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:41:55 BoogieIcfgContainer [2018-11-07 17:41:55,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 17:41:55,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 17:41:55,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 17:41:55,400 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 17:41:55,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:41:51" (1/3) ... [2018-11-07 17:41:55,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41226f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:41:55, skipping insertion in model container [2018-11-07 17:41:55,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:41:51" (2/3) ... [2018-11-07 17:41:55,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41226f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:41:55, skipping insertion in model container [2018-11-07 17:41:55,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:41:55" (3/3) ... [2018-11-07 17:41:55,404 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label42_false-unreach-call.c [2018-11-07 17:41:55,412 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 17:41:55,420 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 17:41:55,436 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 17:41:55,475 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 17:41:55,475 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 17:41:55,475 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 17:41:55,475 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 17:41:55,476 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 17:41:55,479 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 17:41:55,479 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 17:41:55,479 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 17:41:55,507 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-07 17:41:55,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-07 17:41:55,515 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:41:55,516 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] [2018-11-07 17:41:55,519 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:41:55,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:41:55,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1002972724, now seen corresponding path program 1 times [2018-11-07 17:41:55,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:41:55,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:41:55,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:41:55,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:41:55,586 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:41:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:41:55,975 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-07 17:41:55,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:41:55,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 17:41:55,978 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:41:55,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 17:41:56,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 17:41:56,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 17:41:56,005 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 4 states. [2018-11-07 17:41:58,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:41:58,463 INFO L93 Difference]: Finished difference Result 737 states and 1298 transitions. [2018-11-07 17:41:58,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 17:41:58,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-07 17:41:58,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:41:58,487 INFO L225 Difference]: With dead ends: 737 [2018-11-07 17:41:58,487 INFO L226 Difference]: Without dead ends: 515 [2018-11-07 17:41:58,496 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 17:41:58,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-11-07 17:41:58,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2018-11-07 17:41:58,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-11-07 17:41:58,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 848 transitions. [2018-11-07 17:41:58,592 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 848 transitions. Word has length 24 [2018-11-07 17:41:58,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:41:58,592 INFO L480 AbstractCegarLoop]: Abstraction has 515 states and 848 transitions. [2018-11-07 17:41:58,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 17:41:58,593 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 848 transitions. [2018-11-07 17:41:58,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 17:41:58,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:41:58,599 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 17:41:58,599 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:41:58,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:41:58,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1186733907, now seen corresponding path program 1 times [2018-11-07 17:41:58,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:41:58,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:41:58,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:41:58,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:41:58,602 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:41:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:41:59,011 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 17:41:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:41:59,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:41:59,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 17:41:59,177 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:41:59,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 17:41:59,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 17:41:59,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 17:41:59,180 INFO L87 Difference]: Start difference. First operand 515 states and 848 transitions. Second operand 6 states. [2018-11-07 17:42:01,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:42:01,951 INFO L93 Difference]: Finished difference Result 1863 states and 3251 transitions. [2018-11-07 17:42:01,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 17:42:01,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-11-07 17:42:01,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:42:01,971 INFO L225 Difference]: With dead ends: 1863 [2018-11-07 17:42:01,971 INFO L226 Difference]: Without dead ends: 1354 [2018-11-07 17:42:01,979 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 17:42:01,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-11-07 17:42:02,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1331. [2018-11-07 17:42:02,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-11-07 17:42:02,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2051 transitions. [2018-11-07 17:42:02,083 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2051 transitions. Word has length 99 [2018-11-07 17:42:02,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:42:02,083 INFO L480 AbstractCegarLoop]: Abstraction has 1331 states and 2051 transitions. [2018-11-07 17:42:02,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 17:42:02,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2051 transitions. [2018-11-07 17:42:02,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-07 17:42:02,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:42:02,087 INFO L375 BasicCegarLoop]: trace histogram [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-07 17:42:02,088 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:42:02,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:42:02,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1340062609, now seen corresponding path program 1 times [2018-11-07 17:42:02,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:42:02,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:42:02,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:42:02,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:42:02,090 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:42:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:42:02,326 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:42:02,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:42:02,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 17:42:02,327 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:42:02,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 17:42:02,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 17:42:02,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 17:42:02,329 INFO L87 Difference]: Start difference. First operand 1331 states and 2051 transitions. Second operand 6 states. [2018-11-07 17:42:06,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:42:06,304 INFO L93 Difference]: Finished difference Result 3512 states and 5693 transitions. [2018-11-07 17:42:06,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 17:42:06,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2018-11-07 17:42:06,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:42:06,324 INFO L225 Difference]: With dead ends: 3512 [2018-11-07 17:42:06,324 INFO L226 Difference]: Without dead ends: 2187 [2018-11-07 17:42:06,335 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-07 17:42:06,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2018-11-07 17:42:06,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2165. [2018-11-07 17:42:06,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2165 states. [2018-11-07 17:42:06,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 2165 states and 3178 transitions. [2018-11-07 17:42:06,416 INFO L78 Accepts]: Start accepts. Automaton has 2165 states and 3178 transitions. Word has length 101 [2018-11-07 17:42:06,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:42:06,417 INFO L480 AbstractCegarLoop]: Abstraction has 2165 states and 3178 transitions. [2018-11-07 17:42:06,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 17:42:06,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 3178 transitions. [2018-11-07 17:42:06,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-07 17:42:06,420 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:42:06,421 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 17:42:06,421 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:42:06,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:42:06,421 INFO L82 PathProgramCache]: Analyzing trace with hash 457598944, now seen corresponding path program 1 times [2018-11-07 17:42:06,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:42:06,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:42:06,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:42:06,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:42:06,423 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:42:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:42:06,685 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 17:42:06,733 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:42:06,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 17:42:06,733 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 17:42:06,734 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 105 with the following transitions: [2018-11-07 17:42:06,736 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [93], [95], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 17:42:06,779 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 17:42:06,779 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 17:42:07,276 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 17:42:08,057 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 17:42:08,058 INFO L272 AbstractInterpreter]: Visited 88 different actions 497 times. Merged at 5 different actions 25 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 17:42:08,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:42:08,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 17:42:08,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 17:42:08,105 INFO L194 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-07 17:42:08,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:42:08,119 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 17:42:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:42:08,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 17:42:08,398 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:42:08,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 17:42:08,645 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:42:08,674 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 17:42:08,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8 [2018-11-07 17:42:08,675 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:42:08,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 17:42:08,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 17:42:08,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-07 17:42:08,678 INFO L87 Difference]: Start difference. First operand 2165 states and 3178 transitions. Second operand 3 states. [2018-11-07 17:42:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:42:10,501 INFO L93 Difference]: Finished difference Result 4762 states and 7150 transitions. [2018-11-07 17:42:10,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 17:42:10,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-11-07 17:42:10,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:42:10,520 INFO L225 Difference]: With dead ends: 4762 [2018-11-07 17:42:10,520 INFO L226 Difference]: Without dead ends: 2603 [2018-11-07 17:42:10,534 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 207 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-07 17:42:10,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2018-11-07 17:42:10,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 2603. [2018-11-07 17:42:10,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2603 states. [2018-11-07 17:42:10,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2603 states to 2603 states and 3690 transitions. [2018-11-07 17:42:10,627 INFO L78 Accepts]: Start accepts. Automaton has 2603 states and 3690 transitions. Word has length 104 [2018-11-07 17:42:10,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:42:10,628 INFO L480 AbstractCegarLoop]: Abstraction has 2603 states and 3690 transitions. [2018-11-07 17:42:10,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 17:42:10,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2603 states and 3690 transitions. [2018-11-07 17:42:10,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-07 17:42:10,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:42:10,634 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 17:42:10,636 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:42:10,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:42:10,636 INFO L82 PathProgramCache]: Analyzing trace with hash -2140674393, now seen corresponding path program 1 times [2018-11-07 17:42:10,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:42:10,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:42:10,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:42:10,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:42:10,640 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:42:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:42:10,871 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 17:42:10,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 17:42:10,871 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 17:42:10,872 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2018-11-07 17:42:10,872 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [93], [95], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [538], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 17:42:10,877 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 17:42:10,877 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 17:42:11,059 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 17:42:11,061 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 17:42:11,062 INFO L272 AbstractInterpreter]: Visited 85 different actions 85 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-07 17:42:11,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:42:11,100 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 17:42:11,514 INFO L227 lantSequenceWeakener]: Weakened 89 states. On average, predicates are now at 73.31% of their original sizes. [2018-11-07 17:42:11,515 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 17:42:12,322 INFO L415 sIntCurrentIteration]: We unified 104 AI predicates to 104 [2018-11-07 17:42:12,322 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 17:42:12,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 17:42:12,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2018-11-07 17:42:12,324 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:42:12,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 17:42:12,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 17:42:12,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-07 17:42:12,326 INFO L87 Difference]: Start difference. First operand 2603 states and 3690 transitions. Second operand 10 states. [2018-11-07 17:42:31,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:42:31,768 INFO L93 Difference]: Finished difference Result 5349 states and 7615 transitions. [2018-11-07 17:42:31,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 17:42:31,768 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2018-11-07 17:42:31,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:42:31,784 INFO L225 Difference]: With dead ends: 5349 [2018-11-07 17:42:31,784 INFO L226 Difference]: Without dead ends: 2752 [2018-11-07 17:42:31,794 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 108 GetRequests, 86 SyntacticMatches, 10 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-11-07 17:42:31,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2018-11-07 17:42:31,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2747. [2018-11-07 17:42:31,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2747 states. [2018-11-07 17:42:31,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2747 states to 2747 states and 3843 transitions. [2018-11-07 17:42:31,861 INFO L78 Accepts]: Start accepts. Automaton has 2747 states and 3843 transitions. Word has length 105 [2018-11-07 17:42:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:42:31,861 INFO L480 AbstractCegarLoop]: Abstraction has 2747 states and 3843 transitions. [2018-11-07 17:42:31,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 17:42:31,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2747 states and 3843 transitions. [2018-11-07 17:42:31,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-07 17:42:31,865 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:42:31,865 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 17:42:31,865 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:42:31,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:42:31,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1947422875, now seen corresponding path program 1 times [2018-11-07 17:42:31,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:42:31,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:42:31,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:42:31,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:42:31,867 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:42:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:42:32,118 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 17:42:32,357 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 17:42:32,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 17:42:32,357 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 17:42:32,358 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 160 with the following transitions: [2018-11-07 17:42:32,358 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [93], [95], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 17:42:32,364 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 17:42:32,364 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 17:42:33,141 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 17:42:33,141 INFO L272 AbstractInterpreter]: Visited 142 different actions 413 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 17:42:33,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:42:33,179 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 17:42:33,439 INFO L227 lantSequenceWeakener]: Weakened 75 states. On average, predicates are now at 73.61% of their original sizes. [2018-11-07 17:42:33,440 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 17:42:34,694 INFO L415 sIntCurrentIteration]: We unified 158 AI predicates to 158 [2018-11-07 17:42:34,695 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 17:42:34,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 17:42:34,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [4] total 24 [2018-11-07 17:42:34,695 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:42:34,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 17:42:34,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 17:42:34,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2018-11-07 17:42:34,697 INFO L87 Difference]: Start difference. First operand 2747 states and 3843 transitions. Second operand 22 states. [2018-11-07 17:42:37,455 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 17:42:58,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:42:58,187 INFO L93 Difference]: Finished difference Result 5940 states and 8533 transitions. [2018-11-07 17:42:58,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 17:42:58,187 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 159 [2018-11-07 17:42:58,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:42:58,203 INFO L225 Difference]: With dead ends: 5940 [2018-11-07 17:42:58,203 INFO L226 Difference]: Without dead ends: 3343 [2018-11-07 17:42:58,216 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 180 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=345, Invalid=1547, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 17:42:58,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3343 states. [2018-11-07 17:42:58,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3343 to 3189. [2018-11-07 17:42:58,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2018-11-07 17:42:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4335 transitions. [2018-11-07 17:42:58,296 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4335 transitions. Word has length 159 [2018-11-07 17:42:58,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:42:58,297 INFO L480 AbstractCegarLoop]: Abstraction has 3189 states and 4335 transitions. [2018-11-07 17:42:58,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 17:42:58,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4335 transitions. [2018-11-07 17:42:58,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-07 17:42:58,301 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:42:58,301 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 17:42:58,302 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:42:58,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:42:58,302 INFO L82 PathProgramCache]: Analyzing trace with hash 2077930296, now seen corresponding path program 1 times [2018-11-07 17:42:58,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:42:58,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:42:58,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:42:58,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:42:58,304 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:42:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:42:58,567 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 17:42:58,701 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-07 17:42:58,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 17:42:58,702 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 17:42:58,702 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 177 with the following transitions: [2018-11-07 17:42:58,702 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [93], [95], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [538], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 17:42:58,705 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 17:42:58,706 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 17:42:58,755 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 17:42:58,864 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 17:42:58,864 INFO L272 AbstractInterpreter]: Visited 89 different actions 254 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 17:42:58,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:42:58,872 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 17:42:59,104 INFO L227 lantSequenceWeakener]: Weakened 33 states. On average, predicates are now at 74.72% of their original sizes. [2018-11-07 17:42:59,105 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 17:42:59,464 INFO L415 sIntCurrentIteration]: We unified 175 AI predicates to 175 [2018-11-07 17:42:59,466 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 17:42:59,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 17:42:59,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [4] total 23 [2018-11-07 17:42:59,466 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:42:59,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 17:42:59,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 17:42:59,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-11-07 17:42:59,468 INFO L87 Difference]: Start difference. First operand 3189 states and 4335 transitions. Second operand 21 states. [2018-11-07 17:43:15,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:43:15,628 INFO L93 Difference]: Finished difference Result 6381 states and 8808 transitions. [2018-11-07 17:43:15,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 17:43:15,628 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 176 [2018-11-07 17:43:15,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:43:15,645 INFO L225 Difference]: With dead ends: 6381 [2018-11-07 17:43:15,645 INFO L226 Difference]: Without dead ends: 3636 [2018-11-07 17:43:15,655 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 192 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=266, Invalid=1140, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 17:43:15,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3636 states. [2018-11-07 17:43:15,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3636 to 3339. [2018-11-07 17:43:15,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3339 states. [2018-11-07 17:43:15,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3339 states to 3339 states and 4506 transitions. [2018-11-07 17:43:15,743 INFO L78 Accepts]: Start accepts. Automaton has 3339 states and 4506 transitions. Word has length 176 [2018-11-07 17:43:15,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:43:15,743 INFO L480 AbstractCegarLoop]: Abstraction has 3339 states and 4506 transitions. [2018-11-07 17:43:15,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 17:43:15,743 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4506 transitions. [2018-11-07 17:43:15,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-07 17:43:15,748 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:43:15,749 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 17:43:15,749 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:43:15,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:43:15,749 INFO L82 PathProgramCache]: Analyzing trace with hash -439131373, now seen corresponding path program 1 times [2018-11-07 17:43:15,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:43:15,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:43:15,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:43:15,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:43:15,751 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:43:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:43:16,004 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 17:43:16,279 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 35 proven. 6 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-07 17:43:16,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 17:43:16,279 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 17:43:16,280 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 186 with the following transitions: [2018-11-07 17:43:16,280 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [93], [95], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [538], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-07 17:43:16,282 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 17:43:16,282 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 17:43:16,994 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 17:43:17,276 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 17:43:17,277 INFO L272 AbstractInterpreter]: Visited 90 different actions 599 times. Merged at 7 different actions 36 times. Widened at 1 different actions 2 times. Found 3 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 17:43:17,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:43:17,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 17:43:17,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 17:43:17,283 INFO L194 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-07 17:43:17,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:43:17,294 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 17:43:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:43:17,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 17:43:17,471 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 112 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:43:17,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 17:43:17,683 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 112 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:43:17,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 17:43:17,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 17:43:17,705 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 17:43:17,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 17:43:17,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 17:43:17,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 17:43:17,706 INFO L87 Difference]: Start difference. First operand 3339 states and 4506 transitions. Second operand 11 states. [2018-11-07 17:43:21,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:43:21,295 INFO L93 Difference]: Finished difference Result 10499 states and 15443 transitions. [2018-11-07 17:43:21,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 17:43:21,296 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 185 [2018-11-07 17:43:21,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:43:21,311 INFO L225 Difference]: With dead ends: 10499 [2018-11-07 17:43:21,312 INFO L226 Difference]: Without dead ends: 3821 [2018-11-07 17:43:21,343 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 374 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-11-07 17:43:21,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2018-11-07 17:43:21,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 3239. [2018-11-07 17:43:21,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3239 states. [2018-11-07 17:43:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3239 states to 3239 states and 3834 transitions. [2018-11-07 17:43:21,426 INFO L78 Accepts]: Start accepts. Automaton has 3239 states and 3834 transitions. Word has length 185 [2018-11-07 17:43:21,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:43:21,426 INFO L480 AbstractCegarLoop]: Abstraction has 3239 states and 3834 transitions. [2018-11-07 17:43:21,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 17:43:21,427 INFO L276 IsEmpty]: Start isEmpty. Operand 3239 states and 3834 transitions. [2018-11-07 17:43:21,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-07 17:43:21,430 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:43:21,430 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 17:43:21,430 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:43:21,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:43:21,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1826210040, now seen corresponding path program 1 times [2018-11-07 17:43:21,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:43:21,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:43:21,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:43:21,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:43:21,432 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:43:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-07 17:43:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-07 17:43:21,552 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-07 17:43:21,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:43:21 BoogieIcfgContainer [2018-11-07 17:43:21,678 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 17:43:21,679 INFO L168 Benchmark]: Toolchain (without parser) took 90416.09 ms. Allocated memory was 1.6 GB in the beginning and 3.9 GB in the end (delta: 2.3 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -693.5 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-11-07 17:43:21,681 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 17:43:21,682 INFO L168 Benchmark]: CACSL2BoogieTranslator took 707.33 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 17:43:21,682 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.14 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 761.3 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -851.8 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-11-07 17:43:21,684 INFO L168 Benchmark]: Boogie Preprocessor took 91.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. [2018-11-07 17:43:21,686 INFO L168 Benchmark]: RCFGBuilder took 3199.87 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 102.8 MB). Peak memory consumption was 102.8 MB. Max. memory is 7.1 GB. [2018-11-07 17:43:21,686 INFO L168 Benchmark]: TraceAbstraction took 86281.90 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 7.4 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-11-07 17:43:21,693 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.24 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 707.33 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 131.14 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 761.3 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -851.8 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 91.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3199.87 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 102.8 MB). Peak memory consumption was 102.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 86281.90 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 7.4 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 55]: 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)=254629, \old(a10)=254633, \old(a12)=254637, \old(a19)=254630, \old(a4)=254634, \old(inputB)=254636, \old(inputC)=254635, \old(inputD)=254631, \old(inputE)=254628, \old(inputF)=254632, 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=4, 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)=4, 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)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, 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)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=23, a10=0, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND TRUE ((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))) [L211] a1 = (((a1 + -15535) - 211896) / 5) [L212] a10 = 2 [L214] RET return 22; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=4, \result=22, a1=-45481, a10=2, a12=0, a19=9, 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=-45481, a10=2, a12=0, a19=9, a4=14, calculate_output(input)=22, input=4, 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=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=22] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, 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)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, a1=-45481, a10=2, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND TRUE ((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2)))) [L409] a1 = ((((a1 % 299890)+ 300108) * 1) * 1) [L410] a10 = 0 [L411] a19 = 8 [L413] RET return -1; VAL [\old(a1)=-45481, \old(a10)=2, \old(a19)=9, \old(input)=5, \result=-1, a1=254627, a10=0, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=254627, a10=0, a12=0, a19=8, a4=14, calculate_output(input)=-1, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=22] [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=254627, a10=0, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] CALL calculate_output(input) VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, \old(input)=5, a1=254627, 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)=254627, \old(a10)=0, \old(a19)=8, \old(input)=5, a1=254627, a10=0, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, \old(input)=5, a1=254627, a10=0, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, \old(input)=5, a1=254627, a10=0, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, \old(input)=5, a1=254627, a10=0, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, \old(input)=5, a1=254627, a10=0, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, \old(input)=5, a1=254627, a10=0, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, \old(input)=5, a1=254627, a10=0, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, \old(input)=5, a1=254627, a10=0, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, \old(input)=5, a1=254627, a10=0, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, \old(input)=5, a1=254627, a10=0, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, \old(input)=5, a1=254627, a10=0, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND TRUE (((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, \old(input)=5, a1=254627, a10=0, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] __VERIFIER_error() VAL [\old(a1)=254627, \old(a10)=0, \old(a19)=8, \old(input)=5, a1=254627, a10=0, a12=0, a19=8, a4=14, input=5, 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, 86.2s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 73.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1307 SDtfs, 7763 SDslu, 1787 SDs, 0 SdLazy, 13201 SolverSat, 1940 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.9s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 1124 GetRequests, 969 SyntacticMatches, 20 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3339occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.5s AbstIntTime, 5 AbstIntIterations, 3 AbstIntStrong, 0.996414842743566 AbsIntWeakeningRatio, 0.15102974828375287 AbsIntAvgWeakeningVarsNumRemoved, 12.347826086956522 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 8 MinimizatonAttempts, 1083 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1450 NumberOfCodeBlocks, 1450 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1519 ConstructedInterpolants, 0 QuantifiedInterpolants, 728793 SizeOfPredicates, 3 NumberOfNonLiveVariables, 600 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 496/566 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...