./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label31_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label31_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash badb5e839449e413568df201e281c68f67c56eac ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 14:46:01,384 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:46:01,385 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:46:01,392 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:46:01,392 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:46:01,393 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:46:01,393 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:46:01,394 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:46:01,395 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:46:01,395 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:46:01,396 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:46:01,396 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:46:01,396 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:46:01,397 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:46:01,397 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:46:01,398 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:46:01,398 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:46:01,400 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:46:01,401 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:46:01,402 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:46:01,403 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:46:01,404 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:46:01,406 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:46:01,406 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:46:01,406 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:46:01,407 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:46:01,408 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:46:01,408 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:46:01,409 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:46:01,410 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:46:01,411 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:46:01,411 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:46:01,411 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:46:01,411 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:46:01,412 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:46:01,412 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:46:01,412 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 14:46:01,422 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:46:01,422 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:46:01,423 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 14:46:01,423 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 14:46:01,423 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 14:46:01,424 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 14:46:01,424 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 14:46:01,424 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 14:46:01,424 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 14:46:01,424 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 14:46:01,424 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 14:46:01,424 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 14:46:01,424 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 14:46:01,425 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:46:01,425 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:46:01,425 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:46:01,425 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:46:01,425 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:46:01,426 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 14:46:01,427 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 14:46:01,427 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 14:46:01,428 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:46:01,428 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:46:01,428 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:46:01,428 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 14:46:01,428 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:46:01,428 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:46:01,428 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 14:46:01,429 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 14:46:01,429 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 14:46:01,429 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:46:01,429 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 14:46:01,429 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 14:46:01,429 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 14:46:01,429 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 14:46:01,429 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 14:46:01,430 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 14:46:01,430 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> badb5e839449e413568df201e281c68f67c56eac [2018-11-18 14:46:01,454 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:46:01,464 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:46:01,466 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:46:01,467 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:46:01,468 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:46:01,468 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem11_label31_false-unreach-call.c [2018-11-18 14:46:01,509 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/data/e6ac05696/92314f1410d8464abb644a652ef45eb0/FLAG7b9304035 [2018-11-18 14:46:01,993 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:46:01,993 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/sv-benchmarks/c/eca-rers2012/Problem11_label31_false-unreach-call.c [2018-11-18 14:46:02,004 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/data/e6ac05696/92314f1410d8464abb644a652ef45eb0/FLAG7b9304035 [2018-11-18 14:46:02,492 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/data/e6ac05696/92314f1410d8464abb644a652ef45eb0 [2018-11-18 14:46:02,494 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:46:02,495 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 14:46:02,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:46:02,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:46:02,498 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:46:02,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:46:02" (1/1) ... [2018-11-18 14:46:02,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4915a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:02, skipping insertion in model container [2018-11-18 14:46:02,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:46:02" (1/1) ... [2018-11-18 14:46:02,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:46:02,555 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:46:02,877 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:46:02,881 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:46:03,004 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:46:03,017 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:46:03,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:03 WrapperNode [2018-11-18 14:46:03,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:46:03,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 14:46:03,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 14:46:03,018 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 14:46:03,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:03" (1/1) ... [2018-11-18 14:46:03,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:03" (1/1) ... [2018-11-18 14:46:03,122 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 14:46:03,123 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:46:03,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:46:03,123 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:46:03,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:03" (1/1) ... [2018-11-18 14:46:03,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:03" (1/1) ... [2018-11-18 14:46:03,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:03" (1/1) ... [2018-11-18 14:46:03,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:03" (1/1) ... [2018-11-18 14:46:03,159 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:03" (1/1) ... [2018-11-18 14:46:03,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:03" (1/1) ... [2018-11-18 14:46:03,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:03" (1/1) ... [2018-11-18 14:46:03,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:46:03,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:46:03,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:46:03,183 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:46:03,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/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-18 14:46:03,229 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 14:46:03,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 14:46:03,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 14:46:03,230 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-18 14:46:03,230 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-18 14:46:03,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:46:03,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:46:03,230 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 14:46:03,230 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 14:46:04,408 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:46:04,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:46:04 BoogieIcfgContainer [2018-11-18 14:46:04,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:46:04,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 14:46:04,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 14:46:04,411 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 14:46:04,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:46:02" (1/3) ... [2018-11-18 14:46:04,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4bc34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:46:04, skipping insertion in model container [2018-11-18 14:46:04,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:03" (2/3) ... [2018-11-18 14:46:04,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4bc34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:46:04, skipping insertion in model container [2018-11-18 14:46:04,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:46:04" (3/3) ... [2018-11-18 14:46:04,414 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label31_false-unreach-call.c [2018-11-18 14:46:04,420 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 14:46:04,427 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 14:46:04,437 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 14:46:04,462 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 14:46:04,462 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 14:46:04,463 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 14:46:04,463 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:46:04,463 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:46:04,463 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 14:46:04,463 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:46:04,463 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 14:46:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states. [2018-11-18 14:46:04,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 14:46:04,488 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:46:04,489 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:46:04,490 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:46:04,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:04,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1380418692, now seen corresponding path program 1 times [2018-11-18 14:46:04,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:46:04,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:04,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:46:04,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:04,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:46:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:46:04,674 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-18 14:46:04,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:46:04,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:46:04,676 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:46:04,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:46:04,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:46:04,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:46:04,693 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 3 states. [2018-11-18 14:46:05,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:46:05,578 INFO L93 Difference]: Finished difference Result 782 states and 1372 transitions. [2018-11-18 14:46:05,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:46:05,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-18 14:46:05,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:46:05,593 INFO L225 Difference]: With dead ends: 782 [2018-11-18 14:46:05,593 INFO L226 Difference]: Without dead ends: 487 [2018-11-18 14:46:05,598 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:46:05,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-11-18 14:46:05,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 482. [2018-11-18 14:46:05,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-11-18 14:46:05,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 843 transitions. [2018-11-18 14:46:05,652 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 843 transitions. Word has length 14 [2018-11-18 14:46:05,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:46:05,652 INFO L480 AbstractCegarLoop]: Abstraction has 482 states and 843 transitions. [2018-11-18 14:46:05,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:46:05,652 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 843 transitions. [2018-11-18 14:46:05,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-18 14:46:05,655 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:46:05,655 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:46:05,655 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:46:05,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:05,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1196080591, now seen corresponding path program 1 times [2018-11-18 14:46:05,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:46:05,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:05,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:46:05,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:05,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:46:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:46:05,905 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:46:05,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:46:05,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 14:46:05,906 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:46:05,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 14:46:05,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 14:46:05,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-18 14:46:05,908 INFO L87 Difference]: Start difference. First operand 482 states and 843 transitions. Second operand 7 states. [2018-11-18 14:46:07,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:46:07,890 INFO L93 Difference]: Finished difference Result 1755 states and 3230 transitions. [2018-11-18 14:46:07,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 14:46:07,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-11-18 14:46:07,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:46:07,900 INFO L225 Difference]: With dead ends: 1755 [2018-11-18 14:46:07,900 INFO L226 Difference]: Without dead ends: 1279 [2018-11-18 14:46:07,905 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-11-18 14:46:07,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2018-11-18 14:46:07,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1033. [2018-11-18 14:46:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1033 states. [2018-11-18 14:46:07,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1679 transitions. [2018-11-18 14:46:07,952 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1679 transitions. Word has length 89 [2018-11-18 14:46:07,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:46:07,953 INFO L480 AbstractCegarLoop]: Abstraction has 1033 states and 1679 transitions. [2018-11-18 14:46:07,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 14:46:07,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1679 transitions. [2018-11-18 14:46:07,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-18 14:46:07,958 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:46:07,958 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:46:07,958 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:46:07,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:07,959 INFO L82 PathProgramCache]: Analyzing trace with hash -669093568, now seen corresponding path program 1 times [2018-11-18 14:46:07,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:46:07,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:07,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:46:07,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:07,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:46:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:46:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 14 proven. 68 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 14:46:08,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:46:08,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:46:08,131 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 163 with the following transitions: [2018-11-18 14:46:08,133 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [13], [15], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [514], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-18 14:46:08,166 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:46:08,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:46:08,562 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 14:46:08,564 INFO L272 AbstractInterpreter]: Visited 80 different actions 80 times. Never merged. Never widened. Performed 843 root evaluator evaluations with a maximum evaluation depth of 14. Performed 843 inverse root evaluator evaluations with a maximum inverse evaluation depth of 14. Never found a fixpoint. Largest state had 28 variables. [2018-11-18 14:46:08,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:08,582 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 14:46:08,965 INFO L227 lantSequenceWeakener]: Weakened 153 states. On average, predicates are now at 72.84% of their original sizes. [2018-11-18 14:46:08,965 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 14:46:09,004 INFO L415 sIntCurrentIteration]: We unified 161 AI predicates to 161 [2018-11-18 14:46:09,005 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 14:46:09,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 14:46:09,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-18 14:46:09,006 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:46:09,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 14:46:09,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:46:09,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:46:09,007 INFO L87 Difference]: Start difference. First operand 1033 states and 1679 transitions. Second operand 6 states. [2018-11-18 14:46:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:46:19,611 INFO L93 Difference]: Finished difference Result 2252 states and 3562 transitions. [2018-11-18 14:46:19,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 14:46:19,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2018-11-18 14:46:19,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:46:19,616 INFO L225 Difference]: With dead ends: 2252 [2018-11-18 14:46:19,616 INFO L226 Difference]: Without dead ends: 1225 [2018-11-18 14:46:19,618 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 162 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 14:46:19,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-11-18 14:46:19,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1223. [2018-11-18 14:46:19,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2018-11-18 14:46:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1877 transitions. [2018-11-18 14:46:19,645 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1877 transitions. Word has length 162 [2018-11-18 14:46:19,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:46:19,646 INFO L480 AbstractCegarLoop]: Abstraction has 1223 states and 1877 transitions. [2018-11-18 14:46:19,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 14:46:19,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1877 transitions. [2018-11-18 14:46:19,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-18 14:46:19,649 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:46:19,649 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 14:46:19,650 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:46:19,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:19,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1475705382, now seen corresponding path program 1 times [2018-11-18 14:46:19,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:46:19,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:19,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:46:19,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:19,651 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:46:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:46:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:46:20,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:46:20,044 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:46:20,045 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 207 with the following transitions: [2018-11-18 14:46:20,045 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [13], [15], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [514], [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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-18 14:46:20,048 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:46:20,048 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:46:20,823 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:46:20,823 INFO L272 AbstractInterpreter]: Visited 126 different actions 375 times. Merged at 7 different actions 21 times. Never widened. Performed 4937 root evaluator evaluations with a maximum evaluation depth of 16. Performed 4937 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 3 fixpoints after 2 different actions. Largest state had 28 variables. [2018-11-18 14:46:20,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:20,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:46:20,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:46:20,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/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-18 14:46:20,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:46:20,842 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:46:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:46:20,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:46:21,387 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 329 DAG size of output: 31 [2018-11-18 14:46:21,660 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 15 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:46:21,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:46:21,852 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-11-18 14:46:22,538 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 15 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:46:22,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:46:22,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-11-18 14:46:22,555 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:46:22,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 14:46:22,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 14:46:22,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-11-18 14:46:22,556 INFO L87 Difference]: Start difference. First operand 1223 states and 1877 transitions. Second operand 16 states. [2018-11-18 14:46:25,076 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2018-11-18 14:46:27,008 WARN L180 SmtUtils]: Spent 901.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 22 [2018-11-18 14:46:55,233 WARN L180 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-11-18 14:47:09,961 WARN L180 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-11-18 14:47:26,712 WARN L180 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2018-11-18 14:47:28,055 WARN L180 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2018-11-18 14:47:33,717 WARN L180 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-11-18 14:48:11,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:48:11,054 INFO L93 Difference]: Finished difference Result 8527 states and 16304 transitions. [2018-11-18 14:48:11,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-11-18 14:48:11,058 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 206 [2018-11-18 14:48:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:48:11,091 INFO L225 Difference]: With dead ends: 8527 [2018-11-18 14:48:11,091 INFO L226 Difference]: Without dead ends: 7500 [2018-11-18 14:48:11,109 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 403 SyntacticMatches, 2 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5989 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=2277, Invalid=14235, Unknown=0, NotChecked=0, Total=16512 [2018-11-18 14:48:11,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7500 states. [2018-11-18 14:48:11,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7500 to 6774. [2018-11-18 14:48:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6774 states. [2018-11-18 14:48:11,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6774 states to 6774 states and 9240 transitions. [2018-11-18 14:48:11,308 INFO L78 Accepts]: Start accepts. Automaton has 6774 states and 9240 transitions. Word has length 206 [2018-11-18 14:48:11,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:48:11,308 INFO L480 AbstractCegarLoop]: Abstraction has 6774 states and 9240 transitions. [2018-11-18 14:48:11,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 14:48:11,308 INFO L276 IsEmpty]: Start isEmpty. Operand 6774 states and 9240 transitions. [2018-11-18 14:48:11,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-18 14:48:11,311 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:48:11,312 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 14:48:11,312 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:48:11,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:48:11,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1225192974, now seen corresponding path program 1 times [2018-11-18 14:48:11,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:48:11,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:48:11,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:48:11,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:48:11,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:48:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:48:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-18 14:48:11,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:48:11,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:48:11,397 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:48:11,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:48:11,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:48:11,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:48:11,398 INFO L87 Difference]: Start difference. First operand 6774 states and 9240 transitions. Second operand 3 states. [2018-11-18 14:48:12,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:48:12,085 INFO L93 Difference]: Finished difference Result 14157 states and 19961 transitions. [2018-11-18 14:48:12,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:48:12,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2018-11-18 14:48:12,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:48:12,104 INFO L225 Difference]: With dead ends: 14157 [2018-11-18 14:48:12,104 INFO L226 Difference]: Without dead ends: 7959 [2018-11-18 14:48:12,119 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:48:12,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7959 states. [2018-11-18 14:48:12,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7959 to 7780. [2018-11-18 14:48:12,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7780 states. [2018-11-18 14:48:12,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7780 states to 7780 states and 10521 transitions. [2018-11-18 14:48:12,214 INFO L78 Accepts]: Start accepts. Automaton has 7780 states and 10521 transitions. Word has length 216 [2018-11-18 14:48:12,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:48:12,215 INFO L480 AbstractCegarLoop]: Abstraction has 7780 states and 10521 transitions. [2018-11-18 14:48:12,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:48:12,215 INFO L276 IsEmpty]: Start isEmpty. Operand 7780 states and 10521 transitions. [2018-11-18 14:48:12,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-18 14:48:12,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:48:12,217 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 14:48:12,218 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:48:12,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:48:12,218 INFO L82 PathProgramCache]: Analyzing trace with hash -612296166, now seen corresponding path program 1 times [2018-11-18 14:48:12,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:48:12,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:48:12,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:48:12,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:48:12,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:48:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:48:12,407 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:48:12,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:48:12,407 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:48:12,407 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-11-18 14:48:12,407 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [13], [15], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [514], [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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-18 14:48:12,410 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:48:12,411 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:48:12,657 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:48:12,657 INFO L272 AbstractInterpreter]: Visited 136 different actions 402 times. Merged at 7 different actions 18 times. Never widened. Performed 5331 root evaluator evaluations with a maximum evaluation depth of 15. Performed 5331 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 3 fixpoints after 3 different actions. Largest state had 28 variables. [2018-11-18 14:48:12,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:48:12,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:48:12,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:48:12,670 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/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-18 14:48:12,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:48:12,696 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:48:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:48:12,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:48:12,962 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 15 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:48:12,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:48:13,422 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 15 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:48:13,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:48:13,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-11-18 14:48:13,438 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:48:13,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 14:48:13,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 14:48:13,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-11-18 14:48:13,439 INFO L87 Difference]: Start difference. First operand 7780 states and 10521 transitions. Second operand 16 states. [2018-11-18 14:48:16,131 WARN L180 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2018-11-18 14:48:17,604 WARN L180 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2018-11-18 14:48:18,820 WARN L180 SmtUtils]: Spent 954.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-11-18 14:48:19,308 WARN L180 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-11-18 14:48:21,399 WARN L180 SmtUtils]: Spent 920.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-11-18 14:48:23,715 WARN L180 SmtUtils]: Spent 958.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2018-11-18 14:48:25,548 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-11-18 14:48:26,374 WARN L180 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-11-18 14:48:30,484 WARN L180 SmtUtils]: Spent 961.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2018-11-18 14:48:31,441 WARN L180 SmtUtils]: Spent 928.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2018-11-18 14:48:32,827 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-11-18 14:48:37,481 WARN L180 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2018-11-18 14:48:42,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:48:42,347 INFO L93 Difference]: Finished difference Result 18718 states and 29363 transitions. [2018-11-18 14:48:42,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-11-18 14:48:42,347 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 216 [2018-11-18 14:48:42,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:48:42,393 INFO L225 Difference]: With dead ends: 18718 [2018-11-18 14:48:42,393 INFO L226 Difference]: Without dead ends: 11514 [2018-11-18 14:48:42,417 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 423 SyntacticMatches, 2 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6274 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=2395, Invalid=14375, Unknown=0, NotChecked=0, Total=16770 [2018-11-18 14:48:42,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11514 states. [2018-11-18 14:48:42,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11514 to 9935. [2018-11-18 14:48:42,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9935 states. [2018-11-18 14:48:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9935 states to 9935 states and 13298 transitions. [2018-11-18 14:48:42,676 INFO L78 Accepts]: Start accepts. Automaton has 9935 states and 13298 transitions. Word has length 216 [2018-11-18 14:48:42,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:48:42,676 INFO L480 AbstractCegarLoop]: Abstraction has 9935 states and 13298 transitions. [2018-11-18 14:48:42,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 14:48:42,676 INFO L276 IsEmpty]: Start isEmpty. Operand 9935 states and 13298 transitions. [2018-11-18 14:48:42,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-18 14:48:42,679 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:48:42,680 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 14:48:42,680 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:48:42,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:48:42,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1093129036, now seen corresponding path program 1 times [2018-11-18 14:48:42,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:48:42,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:48:42,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:48:42,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:48:42,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:48:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:48:42,882 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 21 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:48:42,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:48:42,882 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:48:42,882 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2018-11-18 14:48:42,883 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [13], [15], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [514], [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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-18 14:48:42,885 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:48:42,886 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:48:43,121 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:48:43,121 INFO L272 AbstractInterpreter]: Visited 141 different actions 417 times. Merged at 7 different actions 18 times. Never widened. Performed 5788 root evaluator evaluations with a maximum evaluation depth of 15. Performed 5788 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 3 fixpoints after 3 different actions. Largest state had 28 variables. [2018-11-18 14:48:43,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:48:43,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:48:43,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:48:43,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:48:43,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:48:43,138 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:48:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:48:43,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:48:43,282 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:48:43,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:48:43,547 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 15 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:48:43,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:48:43,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2018-11-18 14:48:43,562 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:48:43,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 14:48:43,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 14:48:43,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-11-18 14:48:43,563 INFO L87 Difference]: Start difference. First operand 9935 states and 13298 transitions. Second operand 16 states. [2018-11-18 14:48:48,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:48:48,807 INFO L93 Difference]: Finished difference Result 31644 states and 58497 transitions. [2018-11-18 14:48:48,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-18 14:48:48,807 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 221 [2018-11-18 14:48:48,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:48:48,937 INFO L225 Difference]: With dead ends: 31644 [2018-11-18 14:48:48,937 INFO L226 Difference]: Without dead ends: 19845 [2018-11-18 14:48:49,036 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 433 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1297 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=972, Invalid=3584, Unknown=0, NotChecked=0, Total=4556 [2018-11-18 14:48:49,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19845 states. [2018-11-18 14:48:49,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19845 to 15563. [2018-11-18 14:48:49,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15563 states. [2018-11-18 14:48:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15563 states to 15563 states and 21170 transitions. [2018-11-18 14:48:49,759 INFO L78 Accepts]: Start accepts. Automaton has 15563 states and 21170 transitions. Word has length 221 [2018-11-18 14:48:49,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:48:49,760 INFO L480 AbstractCegarLoop]: Abstraction has 15563 states and 21170 transitions. [2018-11-18 14:48:49,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 14:48:49,760 INFO L276 IsEmpty]: Start isEmpty. Operand 15563 states and 21170 transitions. [2018-11-18 14:48:49,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-18 14:48:49,764 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:48:49,765 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 14:48:49,765 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:48:49,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:48:49,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1769082423, now seen corresponding path program 1 times [2018-11-18 14:48:49,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:48:49,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:48:49,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:48:49,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:48:49,767 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:48:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:48:50,000 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:48:50,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:48:50,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:48:50,000 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 238 with the following transitions: [2018-11-18 14:48:50,000 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [13], [15], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [514], [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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [869], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-18 14:48:50,004 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:48:50,004 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:48:50,351 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:48:50,351 INFO L272 AbstractInterpreter]: Visited 157 different actions 468 times. Merged at 7 different actions 21 times. Never widened. Performed 6377 root evaluator evaluations with a maximum evaluation depth of 15. Performed 6377 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 3 fixpoints after 2 different actions. Largest state had 28 variables. [2018-11-18 14:48:50,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:48:50,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:48:50,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:48:50,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:48:50,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:48:50,375 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:48:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:48:50,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:48:50,502 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:48:50,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:48:50,921 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 15 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:48:50,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:48:50,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-11-18 14:48:50,937 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:48:50,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 14:48:50,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 14:48:50,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-11-18 14:48:50,938 INFO L87 Difference]: Start difference. First operand 15563 states and 21170 transitions. Second operand 14 states. [2018-11-18 14:48:59,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:48:59,120 INFO L93 Difference]: Finished difference Result 46076 states and 98624 transitions. [2018-11-18 14:48:59,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-11-18 14:48:59,120 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 237 [2018-11-18 14:48:59,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:48:59,411 INFO L225 Difference]: With dead ends: 46076 [2018-11-18 14:48:59,412 INFO L226 Difference]: Without dead ends: 29860 [2018-11-18 14:48:59,580 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 512 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3119 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1481, Invalid=7831, Unknown=0, NotChecked=0, Total=9312 [2018-11-18 14:48:59,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29860 states. [2018-11-18 14:49:00,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29860 to 24708. [2018-11-18 14:49:00,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24708 states. [2018-11-18 14:49:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24708 states to 24708 states and 32087 transitions. [2018-11-18 14:49:00,444 INFO L78 Accepts]: Start accepts. Automaton has 24708 states and 32087 transitions. Word has length 237 [2018-11-18 14:49:00,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:49:00,444 INFO L480 AbstractCegarLoop]: Abstraction has 24708 states and 32087 transitions. [2018-11-18 14:49:00,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 14:49:00,444 INFO L276 IsEmpty]: Start isEmpty. Operand 24708 states and 32087 transitions. [2018-11-18 14:49:00,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-11-18 14:49:00,459 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:49:00,459 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:49:00,459 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:49:00,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:49:00,460 INFO L82 PathProgramCache]: Analyzing trace with hash -919882578, now seen corresponding path program 1 times [2018-11-18 14:49:00,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:49:00,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:49:00,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:49:00,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:49:00,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:49:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:49:00,986 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 139 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:49:00,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:49:00,986 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:49:00,986 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 286 with the following transitions: [2018-11-18 14:49:00,987 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [13], [15], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [846], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-18 14:49:00,989 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:49:00,989 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:49:01,305 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:49:01,305 INFO L272 AbstractInterpreter]: Visited 153 different actions 597 times. Merged at 7 different actions 21 times. Never widened. Performed 8183 root evaluator evaluations with a maximum evaluation depth of 18. Performed 8183 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 4 fixpoints after 2 different actions. Largest state had 28 variables. [2018-11-18 14:49:01,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:49:01,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:49:01,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:49:01,310 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:49:01,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:49:01,316 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:49:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:49:01,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:49:01,454 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 139 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:49:01,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:49:01,833 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 139 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:49:01,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:49:01,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5] total 20 [2018-11-18 14:49:01,848 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:49:01,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 14:49:01,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 14:49:01,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-11-18 14:49:01,849 INFO L87 Difference]: Start difference. First operand 24708 states and 32087 transitions. Second operand 18 states. [2018-11-18 14:49:06,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:49:06,268 INFO L93 Difference]: Finished difference Result 55015 states and 75659 transitions. [2018-11-18 14:49:06,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-18 14:49:06,269 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 285 [2018-11-18 14:49:06,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:49:06,351 INFO L225 Difference]: With dead ends: 55015 [2018-11-18 14:49:06,351 INFO L226 Difference]: Without dead ends: 30339 [2018-11-18 14:49:06,404 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 574 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=747, Invalid=2333, Unknown=0, NotChecked=0, Total=3080 [2018-11-18 14:49:06,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30339 states. [2018-11-18 14:49:06,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30339 to 28796. [2018-11-18 14:49:06,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28796 states. [2018-11-18 14:49:06,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28796 states to 28796 states and 37392 transitions. [2018-11-18 14:49:06,820 INFO L78 Accepts]: Start accepts. Automaton has 28796 states and 37392 transitions. Word has length 285 [2018-11-18 14:49:06,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:49:06,821 INFO L480 AbstractCegarLoop]: Abstraction has 28796 states and 37392 transitions. [2018-11-18 14:49:06,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 14:49:06,821 INFO L276 IsEmpty]: Start isEmpty. Operand 28796 states and 37392 transitions. [2018-11-18 14:49:06,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-11-18 14:49:06,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:49:06,832 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 14:49:06,832 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:49:06,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:49:06,832 INFO L82 PathProgramCache]: Analyzing trace with hash 847353761, now seen corresponding path program 1 times [2018-11-18 14:49:06,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:49:06,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:49:06,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:49:06,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:49:06,833 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:49:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:49:07,337 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 184 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:49:07,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:49:07,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:49:07,338 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 292 with the following transitions: [2018-11-18 14:49:07,338 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [13], [15], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [514], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-18 14:49:07,339 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:49:07,340 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:49:07,618 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:49:07,618 INFO L272 AbstractInterpreter]: Visited 127 different actions 379 times. Merged at 8 different actions 22 times. Never widened. Performed 4963 root evaluator evaluations with a maximum evaluation depth of 16. Performed 4963 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 5 fixpoints after 3 different actions. Largest state had 28 variables. [2018-11-18 14:49:07,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:49:07,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:49:07,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:49:07,622 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:49:07,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:49:07,628 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:49:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:49:07,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:49:07,751 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-18 14:49:07,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:49:07,965 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-18 14:49:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-18 14:49:08,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:49:08,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5] total 20 [2018-11-18 14:49:08,206 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:49:08,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 14:49:08,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 14:49:08,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-11-18 14:49:08,207 INFO L87 Difference]: Start difference. First operand 28796 states and 37392 transitions. Second operand 18 states. [2018-11-18 14:49:14,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:49:14,487 INFO L93 Difference]: Finished difference Result 61437 states and 87304 transitions. [2018-11-18 14:49:14,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-18 14:49:14,487 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 291 [2018-11-18 14:49:14,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:49:14,573 INFO L225 Difference]: With dead ends: 61437 [2018-11-18 14:49:14,573 INFO L226 Difference]: Without dead ends: 32826 [2018-11-18 14:49:14,637 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 623 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1483 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1061, Invalid=4195, Unknown=0, NotChecked=0, Total=5256 [2018-11-18 14:49:14,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32826 states. [2018-11-18 14:49:15,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32826 to 30275. [2018-11-18 14:49:15,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30275 states. [2018-11-18 14:49:15,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30275 states to 30275 states and 37683 transitions. [2018-11-18 14:49:15,146 INFO L78 Accepts]: Start accepts. Automaton has 30275 states and 37683 transitions. Word has length 291 [2018-11-18 14:49:15,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:49:15,147 INFO L480 AbstractCegarLoop]: Abstraction has 30275 states and 37683 transitions. [2018-11-18 14:49:15,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 14:49:15,147 INFO L276 IsEmpty]: Start isEmpty. Operand 30275 states and 37683 transitions. [2018-11-18 14:49:15,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-11-18 14:49:15,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:49:15,153 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 14:49:15,153 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:49:15,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:49:15,153 INFO L82 PathProgramCache]: Analyzing trace with hash 738841538, now seen corresponding path program 1 times [2018-11-18 14:49:15,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:49:15,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:49:15,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:49:15,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:49:15,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:49:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:49:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 189 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:49:15,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:49:15,409 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:49:15,409 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 297 with the following transitions: [2018-11-18 14:49:15,410 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [13], [15], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [514], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [574], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-18 14:49:15,412 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:49:15,412 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:49:15,861 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:49:15,861 INFO L272 AbstractInterpreter]: Visited 127 different actions 375 times. Merged at 8 different actions 18 times. Never widened. Performed 4920 root evaluator evaluations with a maximum evaluation depth of 16. Performed 4920 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 5 fixpoints after 2 different actions. Largest state had 28 variables. [2018-11-18 14:49:15,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:49:15,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:49:15,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:49:15,862 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:49:15,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:49:15,868 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:49:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:49:15,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:49:16,005 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-18 14:49:16,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:49:16,235 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-18 14:49:16,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:49:16,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-11-18 14:49:16,251 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:49:16,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 14:49:16,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 14:49:16,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-11-18 14:49:16,252 INFO L87 Difference]: Start difference. First operand 30275 states and 37683 transitions. Second operand 14 states. [2018-11-18 14:49:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:49:21,579 INFO L93 Difference]: Finished difference Result 66780 states and 90685 transitions. [2018-11-18 14:49:21,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-11-18 14:49:21,579 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 296 [2018-11-18 14:49:21,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:49:21,677 INFO L225 Difference]: With dead ends: 66780 [2018-11-18 14:49:21,677 INFO L226 Difference]: Without dead ends: 36891 [2018-11-18 14:49:21,745 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 641 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2018 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1161, Invalid=5159, Unknown=0, NotChecked=0, Total=6320 [2018-11-18 14:49:21,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36891 states. [2018-11-18 14:49:22,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36891 to 32931. [2018-11-18 14:49:22,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32931 states. [2018-11-18 14:49:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32931 states to 32931 states and 41225 transitions. [2018-11-18 14:49:22,333 INFO L78 Accepts]: Start accepts. Automaton has 32931 states and 41225 transitions. Word has length 296 [2018-11-18 14:49:22,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:49:22,333 INFO L480 AbstractCegarLoop]: Abstraction has 32931 states and 41225 transitions. [2018-11-18 14:49:22,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 14:49:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 32931 states and 41225 transitions. [2018-11-18 14:49:22,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-11-18 14:49:22,340 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:49:22,340 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:49:22,340 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:49:22,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:49:22,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1828580015, now seen corresponding path program 1 times [2018-11-18 14:49:22,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:49:22,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:49:22,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:49:22,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:49:22,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:49:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:49:22,647 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 34 proven. 221 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 14:49:22,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:49:22,647 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:49:22,647 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 304 with the following transitions: [2018-11-18 14:49:22,648 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [13], [15], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [514], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [562], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-18 14:49:22,650 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:49:22,650 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:49:23,201 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:49:23,201 INFO L272 AbstractInterpreter]: Visited 137 different actions 543 times. Merged at 8 different actions 30 times. Never widened. Performed 7483 root evaluator evaluations with a maximum evaluation depth of 15. Performed 7483 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 7 fixpoints after 2 different actions. Largest state had 28 variables. [2018-11-18 14:49:23,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:49:23,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:49:23,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:49:23,206 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:49:23,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:49:23,212 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:49:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:49:23,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:49:23,338 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-18 14:49:23,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:49:23,582 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-18 14:49:23,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:49:23,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 18 [2018-11-18 14:49:23,598 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:49:23,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 14:49:23,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 14:49:23,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-11-18 14:49:23,599 INFO L87 Difference]: Start difference. First operand 32931 states and 41225 transitions. Second operand 16 states. [2018-11-18 14:49:31,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:49:31,994 INFO L93 Difference]: Finished difference Result 80995 states and 114244 transitions. [2018-11-18 14:49:31,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-11-18 14:49:31,995 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 303 [2018-11-18 14:49:31,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:49:32,173 INFO L225 Difference]: With dead ends: 80995 [2018-11-18 14:49:32,173 INFO L226 Difference]: Without dead ends: 51109 [2018-11-18 14:49:32,250 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 765 GetRequests, 671 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3108 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1483, Invalid=7447, Unknown=0, NotChecked=0, Total=8930 [2018-11-18 14:49:32,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51109 states. [2018-11-18 14:49:33,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51109 to 48082. [2018-11-18 14:49:33,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48082 states. [2018-11-18 14:49:33,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48082 states to 48082 states and 61558 transitions. [2018-11-18 14:49:33,328 INFO L78 Accepts]: Start accepts. Automaton has 48082 states and 61558 transitions. Word has length 303 [2018-11-18 14:49:33,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:49:33,328 INFO L480 AbstractCegarLoop]: Abstraction has 48082 states and 61558 transitions. [2018-11-18 14:49:33,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 14:49:33,328 INFO L276 IsEmpty]: Start isEmpty. Operand 48082 states and 61558 transitions. [2018-11-18 14:49:33,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-11-18 14:49:33,335 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:49:33,335 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-18 14:49:33,335 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:49:33,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:49:33,336 INFO L82 PathProgramCache]: Analyzing trace with hash -936949153, now seen corresponding path program 1 times [2018-11-18 14:49:33,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:49:33,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:49:33,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:49:33,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:49:33,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:49:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:49:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-11-18 14:49:33,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:49:33,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:49:33,441 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:49:33,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:49:33,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:49:33,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:49:33,441 INFO L87 Difference]: Start difference. First operand 48082 states and 61558 transitions. Second operand 3 states. [2018-11-18 14:49:34,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:49:34,512 INFO L93 Difference]: Finished difference Result 108539 states and 141536 transitions. [2018-11-18 14:49:34,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:49:34,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2018-11-18 14:49:34,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:49:34,641 INFO L225 Difference]: With dead ends: 108539 [2018-11-18 14:49:34,642 INFO L226 Difference]: Without dead ends: 64410 [2018-11-18 14:49:34,740 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:49:34,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64410 states. [2018-11-18 14:49:35,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64410 to 64398. [2018-11-18 14:49:35,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64398 states. [2018-11-18 14:49:35,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64398 states to 64398 states and 81225 transitions. [2018-11-18 14:49:35,670 INFO L78 Accepts]: Start accepts. Automaton has 64398 states and 81225 transitions. Word has length 306 [2018-11-18 14:49:35,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:49:35,671 INFO L480 AbstractCegarLoop]: Abstraction has 64398 states and 81225 transitions. [2018-11-18 14:49:35,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:49:35,671 INFO L276 IsEmpty]: Start isEmpty. Operand 64398 states and 81225 transitions. [2018-11-18 14:49:35,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-11-18 14:49:35,680 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:49:35,680 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 14:49:35,680 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:49:35,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:49:35,681 INFO L82 PathProgramCache]: Analyzing trace with hash 24015854, now seen corresponding path program 1 times [2018-11-18 14:49:35,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:49:35,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:49:35,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:49:35,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:49:35,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:49:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:49:36,226 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 35 proven. 238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:49:36,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:49:36,226 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:49:36,226 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 319 with the following transitions: [2018-11-18 14:49:36,227 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [13], [15], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [514], [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], [626], [629], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-18 14:49:36,229 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:49:36,229 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:49:36,642 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:49:36,642 INFO L272 AbstractInterpreter]: Visited 137 different actions 408 times. Merged at 8 different actions 21 times. Never widened. Performed 5412 root evaluator evaluations with a maximum evaluation depth of 16. Performed 5412 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 5 fixpoints after 2 different actions. Largest state had 28 variables. [2018-11-18 14:49:36,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:49:36,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:49:36,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:49:36,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:49:36,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:49:36,671 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:49:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:49:36,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:49:40,654 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 23 proven. 151 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-18 14:49:40,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:49:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-18 14:49:40,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:49:40,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 5] total 26 [2018-11-18 14:49:40,995 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:49:40,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 14:49:40,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 14:49:40,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=550, Unknown=2, NotChecked=0, Total=650 [2018-11-18 14:49:40,996 INFO L87 Difference]: Start difference. First operand 64398 states and 81225 transitions. Second operand 24 states. [2018-11-18 14:49:44,306 WARN L180 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2018-11-18 14:49:45,681 WARN L180 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2018-11-18 14:51:10,517 WARN L180 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-11-18 14:51:45,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:51:45,871 INFO L93 Difference]: Finished difference Result 153754 states and 205390 transitions. [2018-11-18 14:51:45,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-11-18 14:51:45,872 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 318 [2018-11-18 14:51:45,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:51:46,083 INFO L225 Difference]: With dead ends: 153754 [2018-11-18 14:51:46,083 INFO L226 Difference]: Without dead ends: 84718 [2018-11-18 14:51:46,244 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 755 GetRequests, 628 SyntacticMatches, 4 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5531 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=2132, Invalid=13356, Unknown=12, NotChecked=0, Total=15500 [2018-11-18 14:51:46,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84718 states. [2018-11-18 14:51:47,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84718 to 79472. [2018-11-18 14:51:47,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79472 states. [2018-11-18 14:51:47,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79472 states to 79472 states and 97179 transitions. [2018-11-18 14:51:47,589 INFO L78 Accepts]: Start accepts. Automaton has 79472 states and 97179 transitions. Word has length 318 [2018-11-18 14:51:47,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:51:47,589 INFO L480 AbstractCegarLoop]: Abstraction has 79472 states and 97179 transitions. [2018-11-18 14:51:47,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-18 14:51:47,590 INFO L276 IsEmpty]: Start isEmpty. Operand 79472 states and 97179 transitions. [2018-11-18 14:51:47,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-11-18 14:51:47,595 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:51:47,596 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 14:51:47,596 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:51:47,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:47,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1487666814, now seen corresponding path program 1 times [2018-11-18 14:51:47,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:51:47,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:47,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:47,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:51:47,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:51:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:47,758 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 31 proven. 142 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-18 14:51:47,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:51:47,758 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:51:47,758 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 325 with the following transitions: [2018-11-18 14:51:47,758 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [13], [15], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [514], [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], [626], [630], [633], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-18 14:51:47,760 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:51:47,761 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:51:47,987 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:51:47,987 INFO L272 AbstractInterpreter]: Visited 142 different actions 423 times. Merged at 8 different actions 21 times. Never widened. Performed 5832 root evaluator evaluations with a maximum evaluation depth of 15. Performed 5832 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 5 fixpoints after 2 different actions. Largest state had 28 variables. [2018-11-18 14:51:47,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:51:47,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:51:47,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:51:47,989 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:51:47,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:51:47,995 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:51:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:51:48,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:51:50,906 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 168 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-18 14:51:50,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:51:50,999 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 127 proven. 74 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-18 14:51:51,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:51:51,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 11 [2018-11-18 14:51:51,015 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:51:51,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 14:51:51,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 14:51:51,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=74, Unknown=2, NotChecked=0, Total=110 [2018-11-18 14:51:51,016 INFO L87 Difference]: Start difference. First operand 79472 states and 97179 transitions. Second operand 9 states. [2018-11-18 14:51:54,499 WARN L180 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2018-11-18 14:52:18,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:52:18,069 INFO L93 Difference]: Finished difference Result 190353 states and 237455 transitions. [2018-11-18 14:52:18,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 14:52:18,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 324 [2018-11-18 14:52:18,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:52:18,330 INFO L225 Difference]: With dead ends: 190353 [2018-11-18 14:52:18,330 INFO L226 Difference]: Without dead ends: 111267 [2018-11-18 14:52:18,475 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 656 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=159, Invalid=391, Unknown=2, NotChecked=0, Total=552 [2018-11-18 14:52:18,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111267 states. [2018-11-18 14:52:20,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111267 to 107136. [2018-11-18 14:52:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107136 states. [2018-11-18 14:52:20,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107136 states to 107136 states and 129508 transitions. [2018-11-18 14:52:20,206 INFO L78 Accepts]: Start accepts. Automaton has 107136 states and 129508 transitions. Word has length 324 [2018-11-18 14:52:20,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:52:20,207 INFO L480 AbstractCegarLoop]: Abstraction has 107136 states and 129508 transitions. [2018-11-18 14:52:20,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 14:52:20,207 INFO L276 IsEmpty]: Start isEmpty. Operand 107136 states and 129508 transitions. [2018-11-18 14:52:20,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-11-18 14:52:20,211 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:52:20,211 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 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-18 14:52:20,211 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:52:20,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:52:20,211 INFO L82 PathProgramCache]: Analyzing trace with hash 471135602, now seen corresponding path program 1 times [2018-11-18 14:52:20,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:52:20,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:20,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:52:20,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:20,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:52:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:52:20,445 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 36 proven. 138 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-18 14:52:20,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:52:20,445 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:52:20,445 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 339 with the following transitions: [2018-11-18 14:52:20,445 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [13], [15], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [514], [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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [784], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-18 14:52:20,447 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:52:20,447 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:52:21,123 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:52:21,123 INFO L272 AbstractInterpreter]: Visited 142 different actions 567 times. Merged at 8 different actions 34 times. Widened at 1 different actions 1 times. Performed 7783 root evaluator evaluations with a maximum evaluation depth of 16. Performed 7783 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 7 fixpoints after 2 different actions. Largest state had 28 variables. [2018-11-18 14:52:21,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:52:21,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:52:21,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:52:21,138 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:52:21,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:52:21,147 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:52:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:52:21,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:52:21,711 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 170 proven. 4 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-18 14:52:21,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:52:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 23 proven. 151 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-18 14:52:22,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:52:22,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2018-11-18 14:52:22,077 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:52:22,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 14:52:22,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 14:52:22,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-11-18 14:52:22,077 INFO L87 Difference]: Start difference. First operand 107136 states and 129508 transitions. Second operand 16 states. [2018-11-18 14:52:28,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:52:28,470 INFO L93 Difference]: Finished difference Result 229407 states and 297632 transitions. [2018-11-18 14:52:28,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-18 14:52:28,470 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 338 [2018-11-18 14:52:28,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:52:28,907 INFO L225 Difference]: With dead ends: 229407 [2018-11-18 14:52:28,907 INFO L226 Difference]: Without dead ends: 122678 [2018-11-18 14:52:29,109 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 728 GetRequests, 668 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=774, Invalid=2766, Unknown=0, NotChecked=0, Total=3540 [2018-11-18 14:52:29,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122678 states. [2018-11-18 14:52:31,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122678 to 116882. [2018-11-18 14:52:31,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116882 states. [2018-11-18 14:52:31,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116882 states to 116882 states and 141597 transitions. [2018-11-18 14:52:31,659 INFO L78 Accepts]: Start accepts. Automaton has 116882 states and 141597 transitions. Word has length 338 [2018-11-18 14:52:31,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:52:31,659 INFO L480 AbstractCegarLoop]: Abstraction has 116882 states and 141597 transitions. [2018-11-18 14:52:31,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 14:52:31,660 INFO L276 IsEmpty]: Start isEmpty. Operand 116882 states and 141597 transitions. [2018-11-18 14:52:31,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-11-18 14:52:31,663 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:52:31,664 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-18 14:52:31,664 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:52:31,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:52:31,664 INFO L82 PathProgramCache]: Analyzing trace with hash 2015440978, now seen corresponding path program 1 times [2018-11-18 14:52:31,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:52:31,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:31,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:52:31,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:31,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:52:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:52:31,802 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2018-11-18 14:52:31,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:52:31,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:52:31,803 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:52:31,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:52:31,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:52:31,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:52:31,803 INFO L87 Difference]: Start difference. First operand 116882 states and 141597 transitions. Second operand 3 states. [2018-11-18 14:52:33,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:52:33,537 INFO L93 Difference]: Finished difference Result 225803 states and 274399 transitions. [2018-11-18 14:52:33,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:52:33,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 354 [2018-11-18 14:52:33,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:52:33,782 INFO L225 Difference]: With dead ends: 225803 [2018-11-18 14:52:33,783 INFO L226 Difference]: Without dead ends: 115170 [2018-11-18 14:52:33,940 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:52:34,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115170 states. [2018-11-18 14:52:35,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115170 to 113652. [2018-11-18 14:52:35,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113652 states. [2018-11-18 14:52:35,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113652 states to 113652 states and 136904 transitions. [2018-11-18 14:52:35,962 INFO L78 Accepts]: Start accepts. Automaton has 113652 states and 136904 transitions. Word has length 354 [2018-11-18 14:52:35,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:52:35,963 INFO L480 AbstractCegarLoop]: Abstraction has 113652 states and 136904 transitions. [2018-11-18 14:52:35,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:52:35,963 INFO L276 IsEmpty]: Start isEmpty. Operand 113652 states and 136904 transitions. [2018-11-18 14:52:35,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-11-18 14:52:35,967 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:52:35,967 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:52:35,967 INFO L423 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:52:35,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:52:35,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1741808691, now seen corresponding path program 1 times [2018-11-18 14:52:35,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:52:35,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:35,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:52:35,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:52:35,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:52:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:52:36,399 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 218 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:52:36,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:52:36,399 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:52:36,399 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 361 with the following transitions: [2018-11-18 14:52:36,399 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [13], [15], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [514], [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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [777], [781], [785], [789], [793], [797], [808], [812], [816], [819], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-18 14:52:36,401 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:52:36,401 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:52:36,634 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:52:36,634 INFO L272 AbstractInterpreter]: Visited 151 different actions 449 times. Merged at 8 different actions 20 times. Never widened. Performed 6271 root evaluator evaluations with a maximum evaluation depth of 15. Performed 6271 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 5 fixpoints after 2 different actions. Largest state had 28 variables. [2018-11-18 14:52:36,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:52:36,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:52:36,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:52:36,638 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:52:36,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:52:36,645 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:52:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:52:36,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:52:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 150 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:52:37,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:52:37,805 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 218 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:52:37,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:52:37,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 32 [2018-11-18 14:52:37,822 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:52:37,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-18 14:52:37,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 14:52:37,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=847, Unknown=0, NotChecked=0, Total=992 [2018-11-18 14:52:37,823 INFO L87 Difference]: Start difference. First operand 113652 states and 136904 transitions. Second operand 25 states. [2018-11-18 14:52:59,024 WARN L180 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2018-11-18 14:53:00,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:53:00,899 INFO L93 Difference]: Finished difference Result 240404 states and 313022 transitions. [2018-11-18 14:53:00,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-11-18 14:53:00,900 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 360 [2018-11-18 14:53:00,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:53:01,316 INFO L225 Difference]: With dead ends: 240404 [2018-11-18 14:53:01,317 INFO L226 Difference]: Without dead ends: 130239 [2018-11-18 14:53:01,475 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 902 GetRequests, 723 SyntacticMatches, 5 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11598 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=4862, Invalid=25938, Unknown=0, NotChecked=0, Total=30800 [2018-11-18 14:53:01,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130239 states. [2018-11-18 14:53:03,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130239 to 124459. [2018-11-18 14:53:03,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124459 states. [2018-11-18 14:53:03,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124459 states to 124459 states and 150901 transitions. [2018-11-18 14:53:03,800 INFO L78 Accepts]: Start accepts. Automaton has 124459 states and 150901 transitions. Word has length 360 [2018-11-18 14:53:03,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:53:03,801 INFO L480 AbstractCegarLoop]: Abstraction has 124459 states and 150901 transitions. [2018-11-18 14:53:03,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-18 14:53:03,801 INFO L276 IsEmpty]: Start isEmpty. Operand 124459 states and 150901 transitions. [2018-11-18 14:53:03,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-11-18 14:53:03,805 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:53:03,806 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:53:03,806 INFO L423 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:53:03,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:53:03,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1684231884, now seen corresponding path program 1 times [2018-11-18 14:53:03,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:53:03,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:53:03,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:53:03,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:53:03,807 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:53:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:53:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-11-18 14:53:03,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:53:03,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:53:03,904 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:53:03,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:53:03,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:53:03,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:53:03,905 INFO L87 Difference]: Start difference. First operand 124459 states and 150901 transitions. Second operand 3 states. [2018-11-18 14:53:05,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:53:05,793 INFO L93 Difference]: Finished difference Result 237848 states and 288899 transitions. [2018-11-18 14:53:05,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:53:05,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 366 [2018-11-18 14:53:05,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:53:06,047 INFO L225 Difference]: With dead ends: 237848 [2018-11-18 14:53:06,047 INFO L226 Difference]: Without dead ends: 119640 [2018-11-18 14:53:06,211 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:53:06,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119640 states. [2018-11-18 14:53:07,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119640 to 119635. [2018-11-18 14:53:07,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119635 states. [2018-11-18 14:53:08,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119635 states to 119635 states and 143638 transitions. [2018-11-18 14:53:08,033 INFO L78 Accepts]: Start accepts. Automaton has 119635 states and 143638 transitions. Word has length 366 [2018-11-18 14:53:08,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:53:08,034 INFO L480 AbstractCegarLoop]: Abstraction has 119635 states and 143638 transitions. [2018-11-18 14:53:08,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:53:08,034 INFO L276 IsEmpty]: Start isEmpty. Operand 119635 states and 143638 transitions. [2018-11-18 14:53:08,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-11-18 14:53:08,038 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:53:08,038 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-18 14:53:08,038 INFO L423 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:53:08,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:53:08,039 INFO L82 PathProgramCache]: Analyzing trace with hash 390847339, now seen corresponding path program 1 times [2018-11-18 14:53:08,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:53:08,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:53:08,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:53:08,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:53:08,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:53:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:53:08,248 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 236 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-18 14:53:08,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:53:08,249 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:53:08,249 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 371 with the following transitions: [2018-11-18 14:53:08,249 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [13], [15], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [649], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [784], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-18 14:53:08,251 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:53:08,251 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:53:08,567 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:53:08,567 INFO L272 AbstractInterpreter]: Visited 142 different actions 566 times. Merged at 8 different actions 34 times. Widened at 1 different actions 1 times. Performed 7838 root evaluator evaluations with a maximum evaluation depth of 16. Performed 7838 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 6 fixpoints after 3 different actions. Largest state had 28 variables. [2018-11-18 14:53:08,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:53:08,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:53:08,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:53:08,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:53:08,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:53:08,822 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:53:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:53:08,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:53:08,947 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 236 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-18 14:53:08,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:53:09,050 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 236 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-18 14:53:09,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:53:09,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2018-11-18 14:53:09,065 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:53:09,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 14:53:09,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 14:53:09,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-18 14:53:09,066 INFO L87 Difference]: Start difference. First operand 119635 states and 143638 transitions. Second operand 7 states. [2018-11-18 14:53:11,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:53:11,546 INFO L93 Difference]: Finished difference Result 239464 states and 288186 transitions. [2018-11-18 14:53:11,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 14:53:11,546 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 370 [2018-11-18 14:53:11,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:53:11,814 INFO L225 Difference]: With dead ends: 239464 [2018-11-18 14:53:11,814 INFO L226 Difference]: Without dead ends: 124044 [2018-11-18 14:53:11,989 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 753 GetRequests, 740 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-11-18 14:53:12,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124044 states. [2018-11-18 14:53:13,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124044 to 123145. [2018-11-18 14:53:13,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123145 states. [2018-11-18 14:53:14,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123145 states to 123145 states and 147408 transitions. [2018-11-18 14:53:14,226 INFO L78 Accepts]: Start accepts. Automaton has 123145 states and 147408 transitions. Word has length 370 [2018-11-18 14:53:14,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:53:14,226 INFO L480 AbstractCegarLoop]: Abstraction has 123145 states and 147408 transitions. [2018-11-18 14:53:14,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 14:53:14,226 INFO L276 IsEmpty]: Start isEmpty. Operand 123145 states and 147408 transitions. [2018-11-18 14:53:14,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-11-18 14:53:14,236 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:53:14,237 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:53:14,237 INFO L423 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:53:14,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:53:14,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1943324382, now seen corresponding path program 1 times [2018-11-18 14:53:14,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:53:14,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:53:14,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:53:14,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:53:14,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:53:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:53:14,514 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 172 proven. 145 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 14:53:14,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:53:14,514 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:53:14,515 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 405 with the following transitions: [2018-11-18 14:53:14,515 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [13], [15], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [514], [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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [869], [870], [874], [878], [889], [893], [897], [901], [905], [909], [913], [924], [928], [932], [936], [940], [944], [948], [952], [956], [959], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-18 14:53:14,517 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:53:14,517 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:53:22,338 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:53:22,338 INFO L272 AbstractInterpreter]: Visited 177 different actions 527 times. Merged at 8 different actions 20 times. Never widened. Performed 7378 root evaluator evaluations with a maximum evaluation depth of 23. Performed 7378 inverse root evaluator evaluations with a maximum inverse evaluation depth of 23. Found 5 fixpoints after 2 different actions. Largest state had 28 variables. [2018-11-18 14:53:22,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:53:22,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:53:22,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:53:22,340 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:53:22,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:53:22,347 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:53:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:53:22,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:53:32,665 WARN L180 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 37 DAG size of output: 15 [2018-11-18 14:53:33,989 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 96 proven. 223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:53:33,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:53:37,577 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 240 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:53:37,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:53:37,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 8] total 25 [2018-11-18 14:53:37,592 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:53:37,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 14:53:37,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 14:53:37,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=494, Unknown=8, NotChecked=0, Total=600 [2018-11-18 14:53:37,594 INFO L87 Difference]: Start difference. First operand 123145 states and 147408 transitions. Second operand 20 states. [2018-11-18 14:53:42,391 WARN L180 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2018-11-18 14:53:45,496 WARN L180 SmtUtils]: Spent 927.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-18 14:53:50,286 WARN L180 SmtUtils]: Spent 915.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2018-11-18 14:53:53,203 WARN L180 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-11-18 14:53:59,279 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-11-18 14:54:02,984 WARN L180 SmtUtils]: Spent 778.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-18 14:54:10,610 WARN L180 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2018-11-18 14:54:12,056 WARN L180 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2018-11-18 14:54:28,750 WARN L180 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2018-11-18 14:54:38,106 WARN L180 SmtUtils]: Spent 899.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 14:54:39,134 WARN L180 SmtUtils]: Spent 980.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-18 14:54:45,309 WARN L180 SmtUtils]: Spent 917.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 14:54:56,404 WARN L180 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2018-11-18 14:55:11,338 WARN L180 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2018-11-18 14:55:16,653 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 18 [2018-11-18 14:55:16,965 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 29 [2018-11-18 14:55:39,601 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 11 [2018-11-18 14:55:53,735 WARN L180 SmtUtils]: Spent 816.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-18 14:55:59,199 WARN L180 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-11-18 14:56:01,989 WARN L180 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-11-18 14:56:05,769 WARN L180 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2018-11-18 14:56:11,715 WARN L180 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2018-11-18 14:56:14,838 WARN L180 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2018-11-18 14:56:16,386 WARN L180 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-11-18 14:56:19,486 WARN L180 SmtUtils]: Spent 729.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-18 14:56:29,696 WARN L180 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 15 [2018-11-18 14:56:42,891 WARN L180 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2018-11-18 14:56:48,852 WARN L180 SmtUtils]: Spent 796.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 14:56:53,640 WARN L180 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2018-11-18 14:57:14,801 WARN L180 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-11-18 14:57:18,241 WARN L180 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2018-11-18 14:57:37,630 WARN L180 SmtUtils]: Spent 883.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-18 14:57:52,971 WARN L180 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-11-18 14:57:57,906 WARN L180 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2018-11-18 14:58:14,869 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2018-11-18 14:58:58,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:58:58,034 INFO L93 Difference]: Finished difference Result 265624 states and 332930 transitions. [2018-11-18 14:58:58,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-11-18 14:58:58,034 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 404 [2018-11-18 14:58:58,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:58:58,451 INFO L225 Difference]: With dead ends: 265624 [2018-11-18 14:58:58,451 INFO L226 Difference]: Without dead ends: 146698 [2018-11-18 14:58:58,617 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 922 GetRequests, 797 SyntacticMatches, 7 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5108 ImplicationChecksByTransitivity, 154.9s TimeCoverageRelationStatistics Valid=2327, Invalid=11818, Unknown=135, NotChecked=0, Total=14280 [2018-11-18 14:58:58,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146698 states. [2018-11-18 14:59:01,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146698 to 138529. [2018-11-18 14:59:01,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138529 states. [2018-11-18 14:59:01,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138529 states to 138529 states and 164910 transitions. [2018-11-18 14:59:01,622 INFO L78 Accepts]: Start accepts. Automaton has 138529 states and 164910 transitions. Word has length 404 [2018-11-18 14:59:01,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:01,623 INFO L480 AbstractCegarLoop]: Abstraction has 138529 states and 164910 transitions. [2018-11-18 14:59:01,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 14:59:01,623 INFO L276 IsEmpty]: Start isEmpty. Operand 138529 states and 164910 transitions. [2018-11-18 14:59:01,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2018-11-18 14:59:01,638 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:01,638 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-18 14:59:01,638 INFO L423 AbstractCegarLoop]: === Iteration 22 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:01,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:01,639 INFO L82 PathProgramCache]: Analyzing trace with hash 106268832, now seen corresponding path program 1 times [2018-11-18 14:59:01,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:59:01,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:01,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:01,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:01,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:59:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:59:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:59:01,846 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 14:59:01,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:59:01 BoogieIcfgContainer [2018-11-18 14:59:01,969 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 14:59:01,970 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:59:01,970 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:59:01,970 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:59:01,970 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:46:04" (3/4) ... [2018-11-18 14:59:01,972 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 14:59:02,133 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_62664f70-9b7d-4444-84c8-8982b5f82d65/bin-2019/utaipan/witness.graphml [2018-11-18 14:59:02,133 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:59:02,135 INFO L168 Benchmark]: Toolchain (without parser) took 779639.22 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 945.7 MB in the beginning and 1.3 GB in the end (delta: -311.8 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-11-18 14:59:02,136 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 974.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:59:02,136 INFO L168 Benchmark]: CACSL2BoogieTranslator took 521.69 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 886.6 MB in the end (delta: 59.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 11.5 GB. [2018-11-18 14:59:02,136 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 886.6 MB in the beginning and 1.1 GB in the end (delta: -239.2 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2018-11-18 14:59:02,136 INFO L168 Benchmark]: Boogie Preprocessor took 59.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-11-18 14:59:02,137 INFO L168 Benchmark]: RCFGBuilder took 1225.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 952.6 MB in the end (delta: 165.2 MB). Peak memory consumption was 165.2 MB. Max. memory is 11.5 GB. [2018-11-18 14:59:02,137 INFO L168 Benchmark]: TraceAbstraction took 777560.28 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 949.9 MB in the beginning and 1.3 GB in the end (delta: -363.7 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2018-11-18 14:59:02,137 INFO L168 Benchmark]: Witness Printer took 163.79 ms. Allocated memory is still 4.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 56.1 MB). Peak memory consumption was 56.1 MB. Max. memory is 11.5 GB. [2018-11-18 14:59:02,139 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 974.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 521.69 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 886.6 MB in the end (delta: 59.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 104.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 886.6 MB in the beginning and 1.1 GB in the end (delta: -239.2 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1225.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 952.6 MB in the end (delta: 165.2 MB). Peak memory consumption was 165.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 777560.28 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 949.9 MB in the beginning and 1.3 GB in the end (delta: -363.7 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. * Witness Printer took 163.79 ms. Allocated memory is still 4.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 56.1 MB). Peak memory consumption was 56.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputA = 1; [L8] int inputD = 4; [L9] int inputB = 2; [L10] int inputE = 5; [L11] int inputF = 6; [L12] int inputC = 3; [L15] int a29 = 130; [L16] int a4 = 1; [L17] int a23 = 312; [L18] int a8 = 15; [L19] int a25 = 10; [L20] int a3 = 1; VAL [\old(a23)=206683, \old(a25)=206687, \old(a29)=206685, \old(a3)=206684, \old(a4)=206679, \old(a8)=206686, \old(inputA)=206681, \old(inputB)=206682, \old(inputC)=206680, \old(inputD)=206677, \old(inputE)=206676, \old(inputF)=206678, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1031] int output = -1; VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L1042] CALL, EXPR calculate_output(input) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L214] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L240] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L247] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L280] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L294] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L299] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L305] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L310] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L334] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L346] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L353] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L358] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L384] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L391] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L411] COND FALSE !(((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L417] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L422] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((((((input == 6) && ((((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ( ((140 < a29) && (245 >= a29)) && (a25==10)))) && (a8==15)) && (a3==1)) && !(a4==1)) && ((-43 < a23) && (138 >= a23)) )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !(((a3==1) && ( ((140 < a29) && (245 >= a29)) && ( a23 <= -43 && ((a8==15) && (!(a4==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 3)))))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L450] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L456] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L463] COND FALSE !(((a3==1) && ((((((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || (((a25==9) && (!(a4==1) && a29 <= 140 )) && a23 <= -43 )) && (input == 2)) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((((input == 5) && (((((a25==12) && ((a4==1) && 277 < a29 )) && 306 < a23 ) || ((( 277 < a29 && (a4==1)) && (a25==13)) && 306 < a23 )) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !((((a8==15) && (( ((-43 < a23) && (138 >= a23)) && ((input == 1) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (((a25==13) && a29 <= 140 ) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))))) && (a3==1))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !(((a3==1) && ((a8==15) && (((((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 3)) && !(a4==1)) && a23 <= -43 )))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !((( a29 <= 140 && ( ((-43 < a23) && (138 >= a23)) && ((a3==1) && ((a8==15) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 2)))))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L514] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L526] COND FALSE !(((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L531] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 5)) && (a3==1))) && (a25==9)) && a29 <= 140 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L537] COND FALSE !(( 306 < a23 && (((a8==15) && ((((input == 1) && ((a25==11) || (a25==12))) && (a4==1)) && (a3==1))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L542] COND FALSE !(((((a8==15) && ( a23 <= -43 && (((input == 1) && ((a25==10) || (a25==11))) && a29 <= 140 ))) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L549] COND FALSE !(((( a23 <= -43 && (!(a4==1) && ((a3==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 5))))) && (a8==15)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L555] COND FALSE !(((a3==1) && ( ((-43 < a23) && (138 >= a23)) && ((a8==15) && ((((((a25==10) || (a25==11)) || (a25==12)) && (input == 5)) && a29 <= 140 ) && !(a4==1)))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L561] COND FALSE !(( 306 < a23 && (((a3==1) && ( 277 < a29 && (((input == 4) && (((a25==9) || (a25==10)) || (a25==11))) && (a8==15)))) && (a4==1)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L566] COND FALSE !((!(a4==1) && ( a23 <= -43 && ((a8==15) && (((((a25==12) || ((a25==10) || (a25==11))) && (input == 1)) && (a3==1)) && 277 < a29 ))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L572] COND FALSE !(( 277 < a29 && (((a25==13) && ( a23 <= -43 && (!(a4==1) && ((input == 1) && (a3==1))))) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L575] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (((a25==9) && ((input == 4) && !(a4==1))) && a29 <= 140 )) && (a3==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L581] COND FALSE !(((a8==15) && ((((a3==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 3)) && (a4==1))) && 306 < a23 ) && a29 <= 140 ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L586] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && ((a3==1) && (!(a4==1) && ((input == 4) && (((a25==10) && ((140 < a29) && (245 >= a29)) ) || (((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9)))))))) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L598] COND FALSE !(((((a8==15) && ((!(a4==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 6))) && (a3==1))) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L603] COND FALSE !(( a29 <= 140 && (((a4==1) && ((a8==15) && (((input == 6) && (((a25==10) || (a25==11)) || (a25==12))) && 306 < a23 ))) && (a3==1)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L615] COND FALSE !(((((((a3==1) && ((input == 5) && ((a25==11) || (a25==12)))) && (a4==1)) && 306 < a23 ) && ((140 < a29) && (245 >= a29)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L621] COND FALSE !(((((a4==1) && ( 306 < a23 && ((a8==15) && (((a25==11) || (a25==12)) && (input == 2))))) && ((140 < a29) && (245 >= a29)) ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L628] COND FALSE !(((((a8==15) && ( a23 <= -43 && (!(a4==1) && ((a25==11) && (input == 5))))) && (a3==1)) && ((245 < a29) && (277 >= a29)) )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L635] COND FALSE !((((((((input == 2) && ((a25==9) || (a25==10))) && (a8==15)) && ((140 < a29) && (245 >= a29)) ) && 306 < a23 ) && (a3==1)) && (a4==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L642] COND FALSE !(((a8==15) && (((( 277 < a29 && ((input == 2) && ((a25==11) || ((a25==9) || (a25==10))))) && (a4==1)) && (a3==1)) && 306 < a23 ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L647] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 3) && ((a25==12) || ((a25==10) || (a25==11))))) && !(a4==1)) && (a8==15)) && a29 <= 140 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L658] COND FALSE !((((!(a4==1) && ((((input == 6) && ((a25==12) || ((a25==10) || (a25==11)))) && (a8==15)) && ((-43 < a23) && (138 >= a23)) )) && (a3==1)) && a29 <= 140 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L663] COND FALSE !(((a25==9) && (( a29 <= 140 && ((a3==1) && (!(a4==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 2))))) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L670] COND FALSE !((!(a4==1) && ( a23 <= -43 && (((a8==15) && (((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ( ((245 < a29) && (277 >= a29)) && (a25==13))) || ((a25==9) && 277 < a29 )) && (input == 3))) && (a3==1))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L675] COND FALSE !((((!(a4==1) && ((a3==1) && ((input == 5) && ((( ((245 < a29) && (277 >= a29)) && (a25==12)) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ((a25==9) && 277 < a29 ))))) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L681] COND FALSE !(( a23 <= -43 && (!(a4==1) && ( ((245 < a29) && (277 >= a29)) && ((a8==15) && ((a25==11) && ((a3==1) && (input == 3)))))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L688] COND FALSE !(((((a8==15) && ( 306 < a23 && ( ((140 < a29) && (245 >= a29)) && ((input == 1) && ((a25==9) || (a25==10)))))) && (a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L694] COND FALSE !((!(a4==1) && (((((a3==1) && ((input == 2) && (((a25==9) || (a25==10)) || (a25==11)))) && ((140 < a29) && (245 >= a29)) ) && a23 <= -43 ) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L706] COND FALSE !(((((((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))) && (input == 6)) && (a3==1)) && 306 < a23 ) && (a4==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L712] COND FALSE !(( 306 < a23 && ((a8==15) && ( 277 < a29 && ((a4==1) && ((a3==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 5)))))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L717] COND FALSE !(((( 277 < a29 && ((a8==15) && (((input == 6) && a23 <= -43 ) && (a25==13)))) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L731] COND FALSE !(((a3==1) && (((!(a4==1) && ((( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))) && (input == 3))) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L738] COND FALSE !(((a3==1) && (( 306 < a23 && (((a4==1) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 1))) && a29 <= 140 )) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L743] COND FALSE !((((( a23 <= -43 && ((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))))) && (a3==1)) && !(a4==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L750] COND FALSE !(((!(a4==1) && (((a8==15) && ( a29 <= 140 && (((a25==10) || (a25==11)) && (input == 5)))) && a23 <= -43 )) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L757] COND FALSE !((((((a8==15) && ((a3==1) && ( a23 <= -43 && (input == 5)))) && !(a4==1)) && (a25==13)) && 277 < a29 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L769] COND FALSE !(((a8==15) && ((a3==1) && ( 306 < a23 && ((((((a25==11) || (a25==12)) || (a25==13)) && (input == 1)) && (a4==1)) && ((245 < a29) && (277 >= a29)) ))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L774] COND FALSE !((!(a4==1) && (((((((a25==12) || (a25==13)) && (input == 6)) && (a8==15)) && a23 <= -43 ) && (a3==1)) && a29 <= 140 ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L780] COND FALSE !(((a3==1) && (( a23 <= -43 && (((input == 6) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && !(a4==1))) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L787] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 6)) && (a25==9))) && a29 <= 140 ) && (a3==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L792] COND FALSE !((( a29 <= 140 && ((a3==1) && ((a8==15) && ((a25==13) && ( 306 < a23 && (input == 1)))))) && (a4==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L799] COND FALSE !(((a3==1) && (((a8==15) && (((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9)))) && (input == 5)) && 306 < a23 )) && (a4==1)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L804] COND FALSE !((((((a8==15) && ((input == 4) && (( 277 < a29 && (a25==9)) || (( ((245 < a29) && (277 >= a29)) && (a25==12)) || ( ((245 < a29) && (277 >= a29)) && (a25==13)))))) && !(a4==1)) && a23 <= -43 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L816] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (!(a4==1) && ((input == 5) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) )))))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L822] COND FALSE !(( a29 <= 140 && ((((( 306 < a23 && (input == 2)) && (a25==13)) && (a4==1)) && (a3==1)) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L825] COND FALSE !(((a8==15) && ((((a3==1) && ((((a25==10) || (a25==11)) && (input == 6)) && a29 <= 140 )) && a23 <= -43 ) && !(a4==1)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L831] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((a8==15) && (((a25==13) || ((a25==11) || (a25==12))) && (input == 4))) && (a4==1)) && (a3==1)) && 306 < a23 ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L836] COND FALSE !((((a3==1) && ((a8==15) && ((((a25==13) && (input == 4)) && (a4==1)) && a29 <= 140 ))) && 306 < a23 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L841] COND FALSE !((( 306 < a23 && ((a25==13) && ((((input == 3) && a29 <= 140 ) && (a3==1)) && (a4==1)))) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L846] COND FALSE !((!(a4==1) && (( 277 < a29 && ((((input == 4) && a23 <= -43 ) && (a8==15)) && (a3==1))) && (a25==13)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L852] COND FALSE !(((a3==1) && (((((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ) || (( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==12))) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13))))) && (input == 1)) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L859] COND FALSE !(( 277 < a29 && ((a3==1) && ((a8==15) && ((a4==1) && ( 306 < a23 && ((input == 6) && (((a25==9) || (a25==10)) || (a25==11))))))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L865] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 4) && ((a25==12) || ((a25==10) || (a25==11))))) && (a8==15)) && !(a4==1)) && (a3==1)) && a29 <= 140 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L876] COND FALSE !(((((( a23 <= -43 && ((input == 5) && ((a25==12) || ((a25==10) || (a25==11))))) && (a3==1)) && !(a4==1)) && 277 < a29 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L881] COND FALSE !(((((a8==15) && ((a4==1) && (((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 2)))) && (a3==1)) && 306 < a23 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L886] COND FALSE !((( a23 <= -43 && ((( ((140 < a29) && (245 >= a29)) && ((input == 1) && (((a25==9) || (a25==10)) || (a25==11)))) && !(a4==1)) && (a8==15))) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L893] COND TRUE ((((a3==1) && ((((input == 2) && ((a25==12) || ((a25==10) || (a25==11)))) && (a4==1)) && (a8==15))) && a29 <= 140 ) && 306 < a23 ) [L895] a25 = 13 [L897] RET return 23; VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, \result=23, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1042] EXPR calculate_output(input) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, calculate_output(input)=23, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L1042] output = calculate_output(input) [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=23] [L1042] CALL, EXPR calculate_output(input) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L214] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L240] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L247] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L280] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L294] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L299] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L305] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L310] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L334] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L346] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L353] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L358] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L384] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L391] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L411] COND FALSE !(((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L417] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L422] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((((((input == 6) && ((((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ( ((140 < a29) && (245 >= a29)) && (a25==10)))) && (a8==15)) && (a3==1)) && !(a4==1)) && ((-43 < a23) && (138 >= a23)) )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !(((a3==1) && ( ((140 < a29) && (245 >= a29)) && ( a23 <= -43 && ((a8==15) && (!(a4==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 3)))))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L450] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L456] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L463] COND FALSE !(((a3==1) && ((((((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || (((a25==9) && (!(a4==1) && a29 <= 140 )) && a23 <= -43 )) && (input == 2)) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((((input == 5) && (((((a25==12) && ((a4==1) && 277 < a29 )) && 306 < a23 ) || ((( 277 < a29 && (a4==1)) && (a25==13)) && 306 < a23 )) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !((((a8==15) && (( ((-43 < a23) && (138 >= a23)) && ((input == 1) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (((a25==13) && a29 <= 140 ) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))))) && (a3==1))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !(((a3==1) && ((a8==15) && (((((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 3)) && !(a4==1)) && a23 <= -43 )))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !((( a29 <= 140 && ( ((-43 < a23) && (138 >= a23)) && ((a3==1) && ((a8==15) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 2)))))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L514] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L526] COND FALSE !(((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L531] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 5)) && (a3==1))) && (a25==9)) && a29 <= 140 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L537] COND FALSE !(( 306 < a23 && (((a8==15) && ((((input == 1) && ((a25==11) || (a25==12))) && (a4==1)) && (a3==1))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L542] COND FALSE !(((((a8==15) && ( a23 <= -43 && (((input == 1) && ((a25==10) || (a25==11))) && a29 <= 140 ))) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L549] COND FALSE !(((( a23 <= -43 && (!(a4==1) && ((a3==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 5))))) && (a8==15)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L555] COND FALSE !(((a3==1) && ( ((-43 < a23) && (138 >= a23)) && ((a8==15) && ((((((a25==10) || (a25==11)) || (a25==12)) && (input == 5)) && a29 <= 140 ) && !(a4==1)))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L561] COND FALSE !(( 306 < a23 && (((a3==1) && ( 277 < a29 && (((input == 4) && (((a25==9) || (a25==10)) || (a25==11))) && (a8==15)))) && (a4==1)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L566] COND FALSE !((!(a4==1) && ( a23 <= -43 && ((a8==15) && (((((a25==12) || ((a25==10) || (a25==11))) && (input == 1)) && (a3==1)) && 277 < a29 ))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L572] COND FALSE !(( 277 < a29 && (((a25==13) && ( a23 <= -43 && (!(a4==1) && ((input == 1) && (a3==1))))) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L575] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (((a25==9) && ((input == 4) && !(a4==1))) && a29 <= 140 )) && (a3==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L581] COND FALSE !(((a8==15) && ((((a3==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 3)) && (a4==1))) && 306 < a23 ) && a29 <= 140 ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L586] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && ((a3==1) && (!(a4==1) && ((input == 4) && (((a25==10) && ((140 < a29) && (245 >= a29)) ) || (((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9)))))))) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L598] COND FALSE !(((((a8==15) && ((!(a4==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 6))) && (a3==1))) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L603] COND FALSE !(( a29 <= 140 && (((a4==1) && ((a8==15) && (((input == 6) && (((a25==10) || (a25==11)) || (a25==12))) && 306 < a23 ))) && (a3==1)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L615] COND FALSE !(((((((a3==1) && ((input == 5) && ((a25==11) || (a25==12)))) && (a4==1)) && 306 < a23 ) && ((140 < a29) && (245 >= a29)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L621] COND FALSE !(((((a4==1) && ( 306 < a23 && ((a8==15) && (((a25==11) || (a25==12)) && (input == 2))))) && ((140 < a29) && (245 >= a29)) ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L628] COND FALSE !(((((a8==15) && ( a23 <= -43 && (!(a4==1) && ((a25==11) && (input == 5))))) && (a3==1)) && ((245 < a29) && (277 >= a29)) )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L635] COND FALSE !((((((((input == 2) && ((a25==9) || (a25==10))) && (a8==15)) && ((140 < a29) && (245 >= a29)) ) && 306 < a23 ) && (a3==1)) && (a4==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L642] COND FALSE !(((a8==15) && (((( 277 < a29 && ((input == 2) && ((a25==11) || ((a25==9) || (a25==10))))) && (a4==1)) && (a3==1)) && 306 < a23 ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L647] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 3) && ((a25==12) || ((a25==10) || (a25==11))))) && !(a4==1)) && (a8==15)) && a29 <= 140 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L658] COND FALSE !((((!(a4==1) && ((((input == 6) && ((a25==12) || ((a25==10) || (a25==11)))) && (a8==15)) && ((-43 < a23) && (138 >= a23)) )) && (a3==1)) && a29 <= 140 )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L663] COND FALSE !(((a25==9) && (( a29 <= 140 && ((a3==1) && (!(a4==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 2))))) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L670] COND FALSE !((!(a4==1) && ( a23 <= -43 && (((a8==15) && (((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ( ((245 < a29) && (277 >= a29)) && (a25==13))) || ((a25==9) && 277 < a29 )) && (input == 3))) && (a3==1))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L675] COND FALSE !((((!(a4==1) && ((a3==1) && ((input == 5) && ((( ((245 < a29) && (277 >= a29)) && (a25==12)) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ((a25==9) && 277 < a29 ))))) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L681] COND FALSE !(( a23 <= -43 && (!(a4==1) && ( ((245 < a29) && (277 >= a29)) && ((a8==15) && ((a25==11) && ((a3==1) && (input == 3)))))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L688] COND FALSE !(((((a8==15) && ( 306 < a23 && ( ((140 < a29) && (245 >= a29)) && ((input == 1) && ((a25==9) || (a25==10)))))) && (a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L694] COND FALSE !((!(a4==1) && (((((a3==1) && ((input == 2) && (((a25==9) || (a25==10)) || (a25==11)))) && ((140 < a29) && (245 >= a29)) ) && a23 <= -43 ) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L706] COND FALSE !(((((((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))) && (input == 6)) && (a3==1)) && 306 < a23 ) && (a4==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L712] COND FALSE !(( 306 < a23 && ((a8==15) && ( 277 < a29 && ((a4==1) && ((a3==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 5)))))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L717] COND FALSE !(((( 277 < a29 && ((a8==15) && (((input == 6) && a23 <= -43 ) && (a25==13)))) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L731] COND FALSE !(((a3==1) && (((!(a4==1) && ((( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))) && (input == 3))) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L738] COND FALSE !(((a3==1) && (( 306 < a23 && (((a4==1) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 1))) && a29 <= 140 )) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L743] COND FALSE !((((( a23 <= -43 && ((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))))) && (a3==1)) && !(a4==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L750] COND FALSE !(((!(a4==1) && (((a8==15) && ( a29 <= 140 && (((a25==10) || (a25==11)) && (input == 5)))) && a23 <= -43 )) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L757] COND FALSE !((((((a8==15) && ((a3==1) && ( a23 <= -43 && (input == 5)))) && !(a4==1)) && (a25==13)) && 277 < a29 )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L769] COND FALSE !(((a8==15) && ((a3==1) && ( 306 < a23 && ((((((a25==11) || (a25==12)) || (a25==13)) && (input == 1)) && (a4==1)) && ((245 < a29) && (277 >= a29)) ))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L774] COND FALSE !((!(a4==1) && (((((((a25==12) || (a25==13)) && (input == 6)) && (a8==15)) && a23 <= -43 ) && (a3==1)) && a29 <= 140 ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L780] COND FALSE !(((a3==1) && (( a23 <= -43 && (((input == 6) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && !(a4==1))) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L787] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 6)) && (a25==9))) && a29 <= 140 ) && (a3==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L792] COND FALSE !((( a29 <= 140 && ((a3==1) && ((a8==15) && ((a25==13) && ( 306 < a23 && (input == 1)))))) && (a4==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L799] COND FALSE !(((a3==1) && (((a8==15) && (((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9)))) && (input == 5)) && 306 < a23 )) && (a4==1)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L804] COND FALSE !((((((a8==15) && ((input == 4) && (( 277 < a29 && (a25==9)) || (( ((245 < a29) && (277 >= a29)) && (a25==12)) || ( ((245 < a29) && (277 >= a29)) && (a25==13)))))) && !(a4==1)) && a23 <= -43 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L816] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (!(a4==1) && ((input == 5) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) )))))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L822] COND TRUE ( a29 <= 140 && ((((( 306 < a23 && (input == 2)) && (a25==13)) && (a4==1)) && (a3==1)) && (a8==15))) [L823] a29 = (((a29 / 5) + 165004) + 41645) [L824] RET return 23; VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, \result=23, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1042] EXPR calculate_output(input) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, calculate_output(input)=23, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=23] [L1042] output = calculate_output(input) [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=23] [L1042] CALL, EXPR calculate_output(input) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L214] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L240] COND TRUE ((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1)) [L241] a29 = ((((a29 / 5) % 15)+ 260) + 1) [L242] a23 = (((((a23 / 5) % 90)- -47) - -159208) - 159206) [L243] a4 = 1 [L244] a25 = 11 [L246] RET return -1; VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=4, \result=-1, a23=111, a25=11, a29=271, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1042] EXPR calculate_output(input) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, a23=111, a25=11, a29=271, a3=1, a4=1, a8=15, calculate_output(input)=-1, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=23] [L1042] output = calculate_output(input) [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, a23=111, a25=11, a29=271, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L1042] CALL calculate_output(input) VAL [\old(a23)=111, \old(a25)=11, \old(a29)=271, \old(a4)=1, \old(input)=2, a23=111, a25=11, a29=271, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=111, \old(a25)=11, \old(a29)=271, \old(a4)=1, \old(input)=2, a23=111, a25=11, a29=271, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L26] COND TRUE ((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)) VAL [\old(a23)=111, \old(a25)=11, \old(a29)=271, \old(a4)=1, \old(input)=2, a23=111, a25=11, a29=271, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] __VERIFIER_error() VAL [\old(a23)=111, \old(a25)=11, \old(a29)=271, \old(a4)=1, \old(input)=2, a23=111, a25=11, a29=271, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 293 locations, 1 error locations. UNSAFE Result, 777.5s OverallTime, 22 OverallIterations, 4 TraceHistogramMax, 704.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4388 SDtfs, 77117 SDslu, 12776 SDs, 0 SdLazy, 139710 SolverSat, 27153 SolverUnsat, 401 SolverUnknown, 0 SolverNotchecked, 452.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 9940 GetRequests, 8666 SyntacticMatches, 36 SemanticMatches, 1238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47316 ImplicationChecksByTransitivity, 234.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138529occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 13.4s AbstIntTime, 15 AbstIntIterations, 1 AbstIntStrong, 0.997056059882147 AbsIntWeakeningRatio, 0.17391304347826086 AbsIntAvgWeakeningVarsNumRemoved, 17.801242236024844 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 22.8s AutomataMinimizationTime, 21 MinimizatonAttempts, 54808 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 32.6s InterpolantComputationTime, 10266 NumberOfCodeBlocks, 10266 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 13965 ConstructedInterpolants, 50 QuantifiedInterpolants, 33082222 SizeOfPredicates, 43 NumberOfNonLiveVariables, 7434 ConjunctsInSsa, 187 ConjunctsInUnsatCore, 49 InterpolantComputations, 6 PerfectInterpolantSequences, 7447/10230 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...