./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label00_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label00_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/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 a51f684c5d1dac1e77d78cf59294c9ff02da6095 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-635dfa2 [2018-12-09 16:48:13,938 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 16:48:13,939 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 16:48:13,946 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 16:48:13,946 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 16:48:13,947 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 16:48:13,947 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 16:48:13,949 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 16:48:13,950 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 16:48:13,950 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 16:48:13,951 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 16:48:13,951 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 16:48:13,952 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 16:48:13,952 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 16:48:13,953 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 16:48:13,954 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 16:48:13,954 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 16:48:13,956 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 16:48:13,957 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 16:48:13,958 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 16:48:13,959 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 16:48:13,960 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 16:48:13,961 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 16:48:13,962 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 16:48:13,962 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 16:48:13,963 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 16:48:13,963 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 16:48:13,964 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 16:48:13,964 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 16:48:13,965 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 16:48:13,965 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 16:48:13,966 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 16:48:13,966 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 16:48:13,966 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 16:48:13,967 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 16:48:13,967 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 16:48:13,967 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 16:48:13,978 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 16:48:13,978 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 16:48:13,979 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 16:48:13,979 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 16:48:13,979 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 16:48:13,979 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 16:48:13,979 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 16:48:13,979 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 16:48:13,979 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 16:48:13,980 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 16:48:13,980 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 16:48:13,980 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 16:48:13,980 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 16:48:13,980 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 16:48:13,980 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 16:48:13,981 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 16:48:13,981 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 16:48:13,981 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 16:48:13,981 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 16:48:13,981 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 16:48:13,981 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 16:48:13,981 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 16:48:13,981 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 16:48:13,982 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 16:48:13,982 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 16:48:13,982 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 16:48:13,982 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 16:48:13,982 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 16:48:13,982 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 16:48:13,982 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 16:48:13,982 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 16:48:13,982 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 16:48:13,982 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 16:48:13,982 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 16:48:13,982 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 16:48:13,983 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 16:48:13,983 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_6a3f5ab8-2e74-4b55-9da6-35e190071c62/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 -> a51f684c5d1dac1e77d78cf59294c9ff02da6095 [2018-12-09 16:48:14,005 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 16:48:14,014 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 16:48:14,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 16:48:14,018 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 16:48:14,018 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 16:48:14,019 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem11_label00_false-unreach-call.c [2018-12-09 16:48:14,063 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/bin-2019/utaipan/data/954653dea/5936c8fc773b41fba2ffd08ba373634e/FLAGb9dd7212c [2018-12-09 16:48:14,441 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 16:48:14,441 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/sv-benchmarks/c/eca-rers2012/Problem11_label00_false-unreach-call.c [2018-12-09 16:48:14,449 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/bin-2019/utaipan/data/954653dea/5936c8fc773b41fba2ffd08ba373634e/FLAGb9dd7212c [2018-12-09 16:48:14,458 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/bin-2019/utaipan/data/954653dea/5936c8fc773b41fba2ffd08ba373634e [2018-12-09 16:48:14,460 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 16:48:14,461 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 16:48:14,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 16:48:14,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 16:48:14,464 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 16:48:14,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:48:14" (1/1) ... [2018-12-09 16:48:14,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@567fcf63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:14, skipping insertion in model container [2018-12-09 16:48:14,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:48:14" (1/1) ... [2018-12-09 16:48:14,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 16:48:14,504 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 16:48:14,734 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:48:14,737 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 16:48:14,869 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:48:14,878 INFO L195 MainTranslator]: Completed translation [2018-12-09 16:48:14,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:14 WrapperNode [2018-12-09 16:48:14,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 16:48:14,879 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 16:48:14,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 16:48:14,879 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 16:48:14,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:14" (1/1) ... [2018-12-09 16:48:14,895 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:14" (1/1) ... [2018-12-09 16:48:14,900 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 16:48:14,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 16:48:14,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 16:48:14,900 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 16:48:14,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:14" (1/1) ... [2018-12-09 16:48:14,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:14" (1/1) ... [2018-12-09 16:48:14,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:14" (1/1) ... [2018-12-09 16:48:14,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:14" (1/1) ... [2018-12-09 16:48:14,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:14" (1/1) ... [2018-12-09 16:48:14,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:14" (1/1) ... [2018-12-09 16:48:14,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:14" (1/1) ... [2018-12-09 16:48:14,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 16:48:14,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 16:48:14,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 16:48:14,949 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 16:48:14,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/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-12-09 16:48:14,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 16:48:14,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 16:48:14,989 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-09 16:48:14,989 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-09 16:48:14,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 16:48:14,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 16:48:14,990 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 16:48:14,990 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 16:48:15,961 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 16:48:15,961 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 16:48:15,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:48:15 BoogieIcfgContainer [2018-12-09 16:48:15,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 16:48:15,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 16:48:15,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 16:48:15,965 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 16:48:15,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:48:14" (1/3) ... [2018-12-09 16:48:15,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e232156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:48:15, skipping insertion in model container [2018-12-09 16:48:15,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:48:14" (2/3) ... [2018-12-09 16:48:15,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e232156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:48:15, skipping insertion in model container [2018-12-09 16:48:15,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:48:15" (3/3) ... [2018-12-09 16:48:15,968 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label00_false-unreach-call.c [2018-12-09 16:48:15,975 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 16:48:15,980 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 16:48:15,990 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 16:48:16,012 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 16:48:16,012 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 16:48:16,012 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 16:48:16,012 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 16:48:16,012 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 16:48:16,012 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 16:48:16,012 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 16:48:16,012 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 16:48:16,027 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2018-12-09 16:48:16,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 16:48:16,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:48:16,032 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:48:16,033 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:48:16,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:48:16,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1199461691, now seen corresponding path program 1 times [2018-12-09 16:48:16,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:48:16,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:48:16,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:48:16,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:48:16,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:48:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:48:16,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:48:16,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:48:16,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:48:16,148 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:48:16,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:48:16,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:48:16,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:48:16,161 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 3 states. [2018-12-09 16:48:16,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:48:16,928 INFO L93 Difference]: Finished difference Result 780 states and 1368 transitions. [2018-12-09 16:48:16,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:48:16,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-09 16:48:16,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:48:16,938 INFO L225 Difference]: With dead ends: 780 [2018-12-09 16:48:16,938 INFO L226 Difference]: Without dead ends: 425 [2018-12-09 16:48:16,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:48:16,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-12-09 16:48:16,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2018-12-09 16:48:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-12-09 16:48:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 613 transitions. [2018-12-09 16:48:16,979 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 613 transitions. Word has length 12 [2018-12-09 16:48:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:48:16,979 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 613 transitions. [2018-12-09 16:48:16,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:48:16,980 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 613 transitions. [2018-12-09 16:48:16,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 16:48:16,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:48:16,982 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:48:16,983 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:48:16,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:48:16,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1236212934, now seen corresponding path program 1 times [2018-12-09 16:48:16,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:48:16,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:48:16,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:48:16,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:48:16,984 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:48:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:48:17,102 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:48:17,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:48:17,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 16:48:17,102 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:48:17,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:48:17,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:48:17,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:48:17,104 INFO L87 Difference]: Start difference. First operand 425 states and 613 transitions. Second operand 6 states. [2018-12-09 16:48:17,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:48:17,806 INFO L93 Difference]: Finished difference Result 1248 states and 1821 transitions. [2018-12-09 16:48:17,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 16:48:17,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2018-12-09 16:48:17,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:48:17,810 INFO L225 Difference]: With dead ends: 1248 [2018-12-09 16:48:17,810 INFO L226 Difference]: Without dead ends: 829 [2018-12-09 16:48:17,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 16:48:17,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-12-09 16:48:17,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 816. [2018-12-09 16:48:17,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2018-12-09 16:48:17,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1166 transitions. [2018-12-09 16:48:17,831 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1166 transitions. Word has length 84 [2018-12-09 16:48:17,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:48:17,832 INFO L480 AbstractCegarLoop]: Abstraction has 816 states and 1166 transitions. [2018-12-09 16:48:17,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:48:17,832 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1166 transitions. [2018-12-09 16:48:17,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 16:48:17,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:48:17,833 INFO L402 BasicCegarLoop]: trace histogram [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-12-09 16:48:17,833 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:48:17,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:48:17,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1728006093, now seen corresponding path program 1 times [2018-12-09 16:48:17,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:48:17,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:48:17,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:48:17,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:48:17,834 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:48:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:48:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:48:17,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:48:17,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:48:17,881 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:48:17,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:48:17,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:48:17,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:48:17,882 INFO L87 Difference]: Start difference. First operand 816 states and 1166 transitions. Second operand 3 states. [2018-12-09 16:48:18,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:48:18,391 INFO L93 Difference]: Finished difference Result 2024 states and 2914 transitions. [2018-12-09 16:48:18,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:48:18,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-12-09 16:48:18,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:48:18,396 INFO L225 Difference]: With dead ends: 2024 [2018-12-09 16:48:18,396 INFO L226 Difference]: Without dead ends: 1214 [2018-12-09 16:48:18,397 INFO L631 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-12-09 16:48:18,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2018-12-09 16:48:18,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1204. [2018-12-09 16:48:18,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2018-12-09 16:48:18,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1653 transitions. [2018-12-09 16:48:18,421 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1653 transitions. Word has length 85 [2018-12-09 16:48:18,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:48:18,421 INFO L480 AbstractCegarLoop]: Abstraction has 1204 states and 1653 transitions. [2018-12-09 16:48:18,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:48:18,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1653 transitions. [2018-12-09 16:48:18,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 16:48:18,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:48:18,423 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 16:48:18,423 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:48:18,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:48:18,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1656538602, now seen corresponding path program 1 times [2018-12-09 16:48:18,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:48:18,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:48:18,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:48:18,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:48:18,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:48:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:48:18,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:48:18,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:48:18,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:48:18,474 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:48:18,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:48:18,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:48:18,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:48:18,475 INFO L87 Difference]: Start difference. First operand 1204 states and 1653 transitions. Second operand 3 states. [2018-12-09 16:48:19,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:48:19,061 INFO L93 Difference]: Finished difference Result 2792 states and 3886 transitions. [2018-12-09 16:48:19,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:48:19,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-12-09 16:48:19,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:48:19,067 INFO L225 Difference]: With dead ends: 2792 [2018-12-09 16:48:19,067 INFO L226 Difference]: Without dead ends: 1594 [2018-12-09 16:48:19,069 INFO L631 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-12-09 16:48:19,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2018-12-09 16:48:19,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1588. [2018-12-09 16:48:19,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2018-12-09 16:48:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2140 transitions. [2018-12-09 16:48:19,091 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2140 transitions. Word has length 86 [2018-12-09 16:48:19,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:48:19,092 INFO L480 AbstractCegarLoop]: Abstraction has 1588 states and 2140 transitions. [2018-12-09 16:48:19,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:48:19,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2140 transitions. [2018-12-09 16:48:19,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 16:48:19,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:48:19,093 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:48:19,093 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:48:19,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:48:19,093 INFO L82 PathProgramCache]: Analyzing trace with hash -880062806, now seen corresponding path program 1 times [2018-12-09 16:48:19,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:48:19,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:48:19,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:48:19,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:48:19,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:48:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:48:19,150 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:48:19,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:48:19,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 16:48:19,151 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:48:19,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:48:19,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:48:19,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:48:19,152 INFO L87 Difference]: Start difference. First operand 1588 states and 2140 transitions. Second operand 6 states. [2018-12-09 16:48:20,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:48:20,225 INFO L93 Difference]: Finished difference Result 4376 states and 6131 transitions. [2018-12-09 16:48:20,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 16:48:20,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-09 16:48:20,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:48:20,237 INFO L225 Difference]: With dead ends: 4376 [2018-12-09 16:48:20,237 INFO L226 Difference]: Without dead ends: 2794 [2018-12-09 16:48:20,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:48:20,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2794 states. [2018-12-09 16:48:20,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2794 to 2779. [2018-12-09 16:48:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2779 states. [2018-12-09 16:48:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 3612 transitions. [2018-12-09 16:48:20,278 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 3612 transitions. Word has length 92 [2018-12-09 16:48:20,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:48:20,279 INFO L480 AbstractCegarLoop]: Abstraction has 2779 states and 3612 transitions. [2018-12-09 16:48:20,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:48:20,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 3612 transitions. [2018-12-09 16:48:20,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-09 16:48:20,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:48:20,280 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:48:20,280 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:48:20,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:48:20,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1041565358, now seen corresponding path program 1 times [2018-12-09 16:48:20,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:48:20,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:48:20,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:48:20,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:48:20,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:48:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:48:20,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:48:20,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:48:20,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 16:48:20,415 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:48:20,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 16:48:20,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 16:48:20,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:48:20,416 INFO L87 Difference]: Start difference. First operand 2779 states and 3612 transitions. Second operand 7 states. [2018-12-09 16:48:21,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:48:21,574 INFO L93 Difference]: Finished difference Result 5673 states and 7745 transitions. [2018-12-09 16:48:21,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 16:48:21,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2018-12-09 16:48:21,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:48:21,586 INFO L225 Difference]: With dead ends: 5673 [2018-12-09 16:48:21,586 INFO L226 Difference]: Without dead ends: 2900 [2018-12-09 16:48:21,591 INFO L631 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-12-09 16:48:21,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2018-12-09 16:48:21,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 2832. [2018-12-09 16:48:21,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2832 states. [2018-12-09 16:48:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2832 states to 2832 states and 3724 transitions. [2018-12-09 16:48:21,656 INFO L78 Accepts]: Start accepts. Automaton has 2832 states and 3724 transitions. Word has length 106 [2018-12-09 16:48:21,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:48:21,657 INFO L480 AbstractCegarLoop]: Abstraction has 2832 states and 3724 transitions. [2018-12-09 16:48:21,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 16:48:21,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2832 states and 3724 transitions. [2018-12-09 16:48:21,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-09 16:48:21,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:48:21,658 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:48:21,658 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:48:21,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:48:21,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1974589244, now seen corresponding path program 1 times [2018-12-09 16:48:21,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:48:21,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:48:21,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:48:21,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:48:21,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:48:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:48:21,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:48:21,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:48:21,774 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:48:21,774 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 144 with the following transitions: [2018-12-09 16:48:21,775 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [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], [751], [762], [766], [769], [772], [776], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-09 16:48:21,803 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:48:21,804 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:48:22,323 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:48:22,324 INFO L272 AbstractInterpreter]: Visited 139 different actions 403 times. Merged at 4 different actions 7 times. Never widened. Performed 5623 root evaluator evaluations with a maximum evaluation depth of 9. Performed 5623 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-12-09 16:48:22,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:48:22,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:48:22,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:48:22,329 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/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-12-09 16:48:22,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:48:22,337 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:48:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:48:22,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:48:22,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:48:22,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:48:22,435 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:48:22,451 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 16:48:22,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 10 [2018-12-09 16:48:22,451 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:48:22,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:48:22,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:48:22,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-09 16:48:22,452 INFO L87 Difference]: Start difference. First operand 2832 states and 3724 transitions. Second operand 3 states. [2018-12-09 16:48:23,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:48:23,048 INFO L93 Difference]: Finished difference Result 6441 states and 8614 transitions. [2018-12-09 16:48:23,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:48:23,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2018-12-09 16:48:23,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:48:23,059 INFO L225 Difference]: With dead ends: 6441 [2018-12-09 16:48:23,059 INFO L226 Difference]: Without dead ends: 3615 [2018-12-09 16:48:23,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-09 16:48:23,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2018-12-09 16:48:23,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 3414. [2018-12-09 16:48:23,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3414 states. [2018-12-09 16:48:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3414 states to 3414 states and 4474 transitions. [2018-12-09 16:48:23,127 INFO L78 Accepts]: Start accepts. Automaton has 3414 states and 4474 transitions. Word has length 143 [2018-12-09 16:48:23,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:48:23,128 INFO L480 AbstractCegarLoop]: Abstraction has 3414 states and 4474 transitions. [2018-12-09 16:48:23,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:48:23,128 INFO L276 IsEmpty]: Start isEmpty. Operand 3414 states and 4474 transitions. [2018-12-09 16:48:23,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-09 16:48:23,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:48:23,130 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 16:48:23,130 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:48:23,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:48:23,130 INFO L82 PathProgramCache]: Analyzing trace with hash 852307655, now seen corresponding path program 1 times [2018-12-09 16:48:23,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:48:23,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:48:23,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:48:23,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:48:23,131 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:48:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:48:23,328 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:48:23,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:48:23,329 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:48:23,329 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 223 with the following transitions: [2018-12-09 16:48:23,329 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [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], [594], [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], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-09 16:48:23,332 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:48:23,332 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:48:23,819 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:48:23,819 INFO L272 AbstractInterpreter]: Visited 125 different actions 370 times. Merged at 6 different actions 17 times. Never widened. Performed 4919 root evaluator evaluations with a maximum evaluation depth of 16. Performed 4919 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-12-09 16:48:23,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:48:23,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:48:23,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:48:23,821 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/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-12-09 16:48:23,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:48:23,829 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:48:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:48:23,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:48:26,327 WARN L180 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 152 DAG size of output: 28 [2018-12-09 16:48:26,457 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 11 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:48:26,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:48:27,064 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 11 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:48:27,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:48:27,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-12-09 16:48:27,080 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:48:27,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 16:48:27,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 16:48:27,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-12-09 16:48:27,080 INFO L87 Difference]: Start difference. First operand 3414 states and 4474 transitions. Second operand 16 states. [2018-12-09 16:48:29,193 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2018-12-09 16:48:31,468 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2018-12-09 16:49:11,948 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-09 16:49:16,159 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2018-12-09 16:49:20,207 WARN L180 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2018-12-09 16:49:21,756 WARN L180 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2018-12-09 16:50:21,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:50:21,372 INFO L93 Difference]: Finished difference Result 13037 states and 21140 transitions. [2018-12-09 16:50:21,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-09 16:50:21,373 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 222 [2018-12-09 16:50:21,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:50:21,395 INFO L225 Difference]: With dead ends: 13037 [2018-12-09 16:50:21,396 INFO L226 Difference]: Without dead ends: 9433 [2018-12-09 16:50:21,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 435 SyntacticMatches, 3 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4291 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=1843, Invalid=10586, Unknown=3, NotChecked=0, Total=12432 [2018-12-09 16:50:21,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9433 states. [2018-12-09 16:50:21,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9433 to 8695. [2018-12-09 16:50:21,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8695 states. [2018-12-09 16:50:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8695 states to 8695 states and 11298 transitions. [2018-12-09 16:50:21,561 INFO L78 Accepts]: Start accepts. Automaton has 8695 states and 11298 transitions. Word has length 222 [2018-12-09 16:50:21,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:50:21,562 INFO L480 AbstractCegarLoop]: Abstraction has 8695 states and 11298 transitions. [2018-12-09 16:50:21,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 16:50:21,562 INFO L276 IsEmpty]: Start isEmpty. Operand 8695 states and 11298 transitions. [2018-12-09 16:50:21,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-12-09 16:50:21,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:50:21,564 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 16:50:21,564 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:50:21,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:50:21,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1697778707, now seen corresponding path program 1 times [2018-12-09 16:50:21,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:50:21,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:50:21,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:50:21,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:50:21,565 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:50:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:50:21,742 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:50:21,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:50:21,742 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:50:21,742 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2018-12-09 16:50:21,742 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [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], [594], [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], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-09 16:50:21,745 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:50:21,745 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:50:22,009 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:50:22,009 INFO L272 AbstractInterpreter]: Visited 135 different actions 396 times. Merged at 6 different actions 13 times. Never widened. Performed 5275 root evaluator evaluations with a maximum evaluation depth of 13. Performed 5275 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 3 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-09 16:50:22,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:50:22,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:50:22,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:50:22,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/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-12-09 16:50:22,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:50:22,019 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:50:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:50:22,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:50:22,321 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 11 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:50:22,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:50:22,731 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 11 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:50:22,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:50:22,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-12-09 16:50:22,747 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:50:22,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 16:50:22,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 16:50:22,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-12-09 16:50:22,747 INFO L87 Difference]: Start difference. First operand 8695 states and 11298 transitions. Second operand 16 states. [2018-12-09 16:50:23,688 WARN L180 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-12-09 16:50:24,570 WARN L180 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2018-12-09 16:50:25,291 WARN L180 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2018-12-09 16:50:25,787 WARN L180 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2018-12-09 16:50:26,463 WARN L180 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-12-09 16:50:26,698 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2018-12-09 16:50:27,165 WARN L180 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-09 16:50:28,062 WARN L180 SmtUtils]: Spent 807.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2018-12-09 16:50:28,857 WARN L180 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2018-12-09 16:50:29,992 WARN L180 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-09 16:50:30,571 WARN L180 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-12-09 16:50:31,250 WARN L180 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-12-09 16:50:31,539 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-12-09 16:50:41,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:50:41,954 INFO L93 Difference]: Finished difference Result 20592 states and 30095 transitions. [2018-12-09 16:50:41,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-09 16:50:41,955 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 232 [2018-12-09 16:50:41,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:50:41,984 INFO L225 Difference]: With dead ends: 20592 [2018-12-09 16:50:41,985 INFO L226 Difference]: Without dead ends: 12281 [2018-12-09 16:50:42,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 455 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4525 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1966, Invalid=10690, Unknown=0, NotChecked=0, Total=12656 [2018-12-09 16:50:42,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12281 states. [2018-12-09 16:50:42,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12281 to 11738. [2018-12-09 16:50:42,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11738 states. [2018-12-09 16:50:42,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11738 states to 11738 states and 15070 transitions. [2018-12-09 16:50:42,207 INFO L78 Accepts]: Start accepts. Automaton has 11738 states and 15070 transitions. Word has length 232 [2018-12-09 16:50:42,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:50:42,207 INFO L480 AbstractCegarLoop]: Abstraction has 11738 states and 15070 transitions. [2018-12-09 16:50:42,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 16:50:42,207 INFO L276 IsEmpty]: Start isEmpty. Operand 11738 states and 15070 transitions. [2018-12-09 16:50:42,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-12-09 16:50:42,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:50:42,209 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 16:50:42,210 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:50:42,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:50:42,210 INFO L82 PathProgramCache]: Analyzing trace with hash 510977348, now seen corresponding path program 1 times [2018-12-09 16:50:42,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:50:42,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:50:42,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:50:42,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:50:42,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:50:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:50:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-12-09 16:50:42,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:50:42,371 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:50:42,371 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2018-12-09 16:50:42,371 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [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], [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], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-09 16:50:42,373 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:50:42,374 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:50:42,642 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:50:42,642 INFO L272 AbstractInterpreter]: Visited 140 different actions 548 times. Merged at 6 different actions 19 times. Never widened. Performed 7707 root evaluator evaluations with a maximum evaluation depth of 9. Performed 7707 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 4 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-09 16:50:42,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:50:42,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:50:42,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:50:42,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/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-12-09 16:50:42,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:50:42,652 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:50:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:50:42,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:50:42,752 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:50:42,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:50:42,815 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:50:42,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:50:42,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-12-09 16:50:42,839 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:50:42,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 16:50:42,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 16:50:42,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-09 16:50:42,840 INFO L87 Difference]: Start difference. First operand 11738 states and 15070 transitions. Second operand 11 states. [2018-12-09 16:50:45,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:50:45,282 INFO L93 Difference]: Finished difference Result 33116 states and 44387 transitions. [2018-12-09 16:50:45,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 16:50:45,283 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 232 [2018-12-09 16:50:45,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:50:45,322 INFO L225 Difference]: With dead ends: 33116 [2018-12-09 16:50:45,322 INFO L226 Difference]: Without dead ends: 21762 [2018-12-09 16:50:45,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 466 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2018-12-09 16:50:45,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states. [2018-12-09 16:50:45,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 18376. [2018-12-09 16:50:45,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18376 states. [2018-12-09 16:50:45,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18376 states to 18376 states and 23817 transitions. [2018-12-09 16:50:45,562 INFO L78 Accepts]: Start accepts. Automaton has 18376 states and 23817 transitions. Word has length 232 [2018-12-09 16:50:45,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:50:45,562 INFO L480 AbstractCegarLoop]: Abstraction has 18376 states and 23817 transitions. [2018-12-09 16:50:45,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 16:50:45,563 INFO L276 IsEmpty]: Start isEmpty. Operand 18376 states and 23817 transitions. [2018-12-09 16:50:45,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-12-09 16:50:45,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:50:45,565 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 16:50:45,565 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:50:45,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:50:45,565 INFO L82 PathProgramCache]: Analyzing trace with hash -55547616, now seen corresponding path program 1 times [2018-12-09 16:50:45,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:50:45,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:50:45,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:50:45,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:50:45,566 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:50:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:50:45,762 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:50:45,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:50:45,762 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:50:45,763 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2018-12-09 16:50:45,763 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [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], [582], [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], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-09 16:50:45,764 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:50:45,764 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:50:46,007 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:50:46,007 INFO L272 AbstractInterpreter]: Visited 140 different actions 547 times. Merged at 6 different actions 18 times. Never widened. Performed 7698 root evaluator evaluations with a maximum evaluation depth of 9. Performed 7698 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 4 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-09 16:50:46,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:50:46,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:50:46,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:50:46,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/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-12-09 16:50:46,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:50:46,018 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:50:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:50:46,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:50:47,020 WARN L180 SmtUtils]: Spent 885.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 39 [2018-12-09 16:50:47,090 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 88 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:50:47,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:50:47,377 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:50:47,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:50:47,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 21 [2018-12-09 16:50:47,393 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:50:47,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 16:50:47,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 16:50:47,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-12-09 16:50:47,394 INFO L87 Difference]: Start difference. First operand 18376 states and 23817 transitions. Second operand 15 states. [2018-12-09 16:50:50,769 WARN L180 SmtUtils]: Spent 819.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-12-09 16:50:52,095 WARN L180 SmtUtils]: Spent 819.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2018-12-09 16:50:53,079 WARN L180 SmtUtils]: Spent 802.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2018-12-09 16:50:58,773 WARN L180 SmtUtils]: Spent 803.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2018-12-09 16:51:02,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:51:02,158 INFO L93 Difference]: Finished difference Result 38984 states and 52814 transitions. [2018-12-09 16:51:02,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-09 16:51:02,159 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 234 [2018-12-09 16:51:02,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:51:02,192 INFO L225 Difference]: With dead ends: 38984 [2018-12-09 16:51:02,192 INFO L226 Difference]: Without dead ends: 20992 [2018-12-09 16:51:02,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 461 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=547, Invalid=1615, Unknown=0, NotChecked=0, Total=2162 [2018-12-09 16:51:02,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20992 states. [2018-12-09 16:51:02,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20992 to 20131. [2018-12-09 16:51:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20131 states. [2018-12-09 16:51:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20131 states to 20131 states and 25516 transitions. [2018-12-09 16:51:02,435 INFO L78 Accepts]: Start accepts. Automaton has 20131 states and 25516 transitions. Word has length 234 [2018-12-09 16:51:02,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:51:02,436 INFO L480 AbstractCegarLoop]: Abstraction has 20131 states and 25516 transitions. [2018-12-09 16:51:02,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 16:51:02,436 INFO L276 IsEmpty]: Start isEmpty. Operand 20131 states and 25516 transitions. [2018-12-09 16:51:02,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-12-09 16:51:02,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:51:02,438 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 16:51:02,438 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:51:02,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:51:02,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1764883575, now seen corresponding path program 1 times [2018-12-09 16:51:02,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:51:02,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:51:02,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:51:02,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:51:02,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:51:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:51:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 16 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:51:02,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:51:02,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:51:02,645 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 238 with the following transitions: [2018-12-09 16:51:02,645 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [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], [594], [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], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-09 16:51:02,646 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:51:02,646 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:51:02,877 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:51:02,878 INFO L272 AbstractInterpreter]: Visited 140 different actions 414 times. Merged at 6 different actions 15 times. Never widened. Performed 5756 root evaluator evaluations with a maximum evaluation depth of 13. Performed 5756 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 3 fixpoints after 3 different actions. Largest state had 28 variables. [2018-12-09 16:51:02,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:51:02,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:51:02,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:51:02,879 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/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-12-09 16:51:02,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:51:02,886 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:51:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:51:02,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:51:03,005 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:51:03,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:51:03,291 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 11 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:51:03,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:51:03,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2018-12-09 16:51:03,306 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:51:03,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 16:51:03,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 16:51:03,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-12-09 16:51:03,307 INFO L87 Difference]: Start difference. First operand 20131 states and 25516 transitions. Second operand 16 states. [2018-12-09 16:51:07,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:51:07,864 INFO L93 Difference]: Finished difference Result 48697 states and 67863 transitions. [2018-12-09 16:51:07,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-09 16:51:07,865 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 237 [2018-12-09 16:51:07,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:51:07,922 INFO L225 Difference]: With dead ends: 48697 [2018-12-09 16:51:07,922 INFO L226 Difference]: Without dead ends: 28756 [2018-12-09 16:51:07,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 465 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=852, Invalid=3054, Unknown=0, NotChecked=0, Total=3906 [2018-12-09 16:51:07,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28756 states. [2018-12-09 16:51:08,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28756 to 27833. [2018-12-09 16:51:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27833 states. [2018-12-09 16:51:08,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27833 states to 27833 states and 35248 transitions. [2018-12-09 16:51:08,321 INFO L78 Accepts]: Start accepts. Automaton has 27833 states and 35248 transitions. Word has length 237 [2018-12-09 16:51:08,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:51:08,322 INFO L480 AbstractCegarLoop]: Abstraction has 27833 states and 35248 transitions. [2018-12-09 16:51:08,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 16:51:08,322 INFO L276 IsEmpty]: Start isEmpty. Operand 27833 states and 35248 transitions. [2018-12-09 16:51:08,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-12-09 16:51:08,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:51:08,324 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 16:51:08,324 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:51:08,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:51:08,324 INFO L82 PathProgramCache]: Analyzing trace with hash 598484482, now seen corresponding path program 1 times [2018-12-09 16:51:08,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:51:08,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:51:08,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:51:08,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:51:08,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:51:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:51:08,533 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:51:08,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:51:08,534 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:51:08,534 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 254 with the following transitions: [2018-12-09 16:51:08,534 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [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], [594], [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], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-09 16:51:08,536 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:51:08,536 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:51:08,793 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:51:08,793 INFO L272 AbstractInterpreter]: Visited 156 different actions 463 times. Merged at 6 different actions 17 times. Never widened. Performed 6379 root evaluator evaluations with a maximum evaluation depth of 13. Performed 6379 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 3 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-09 16:51:08,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:51:08,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:51:08,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:51:08,805 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/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-12-09 16:51:08,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:51:08,811 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:51:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:51:08,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:51:08,937 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:51:08,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:51:09,281 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 11 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:51:09,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:51:09,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2018-12-09 16:51:09,295 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:51:09,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 16:51:09,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 16:51:09,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2018-12-09 16:51:09,296 INFO L87 Difference]: Start difference. First operand 27833 states and 35248 transitions. Second operand 13 states. [2018-12-09 16:51:14,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:51:14,704 INFO L93 Difference]: Finished difference Result 55807 states and 83258 transitions. [2018-12-09 16:51:14,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-09 16:51:14,705 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 253 [2018-12-09 16:51:14,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:51:14,808 INFO L225 Difference]: With dead ends: 55807 [2018-12-09 16:51:14,808 INFO L226 Difference]: Without dead ends: 30862 [2018-12-09 16:51:14,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 523 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=904, Invalid=4066, Unknown=0, NotChecked=0, Total=4970 [2018-12-09 16:51:14,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30862 states. [2018-12-09 16:51:15,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30862 to 27487. [2018-12-09 16:51:15,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27487 states. [2018-12-09 16:51:15,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27487 states to 27487 states and 34413 transitions. [2018-12-09 16:51:15,372 INFO L78 Accepts]: Start accepts. Automaton has 27487 states and 34413 transitions. Word has length 253 [2018-12-09 16:51:15,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:51:15,372 INFO L480 AbstractCegarLoop]: Abstraction has 27487 states and 34413 transitions. [2018-12-09 16:51:15,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 16:51:15,372 INFO L276 IsEmpty]: Start isEmpty. Operand 27487 states and 34413 transitions. [2018-12-09 16:51:15,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-12-09 16:51:15,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:51:15,376 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 16:51:15,376 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:51:15,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:51:15,376 INFO L82 PathProgramCache]: Analyzing trace with hash -906141529, now seen corresponding path program 1 times [2018-12-09 16:51:15,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:51:15,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:51:15,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:51:15,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:51:15,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:51:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:51:15,593 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 200 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:51:15,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:51:15,593 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:51:15,593 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 312 with the following transitions: [2018-12-09 16:51:15,593 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [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], [574], [575], [579], [583], [587], [591], [594], [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], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-09 16:51:15,594 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:51:15,594 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:51:15,894 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:51:15,895 INFO L272 AbstractInterpreter]: Visited 126 different actions 374 times. Merged at 7 different actions 18 times. Never widened. Performed 4923 root evaluator evaluations with a maximum evaluation depth of 16. Performed 4923 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-12-09 16:51:15,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:51:15,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:51:15,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:51:15,896 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/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-12-09 16:51:15,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:51:15,904 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:51:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:51:15,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:51:16,041 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 199 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-09 16:51:16,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:51:16,318 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 199 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-09 16:51:16,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:51:16,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-12-09 16:51:16,334 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:51:16,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 16:51:16,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 16:51:16,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-12-09 16:51:16,334 INFO L87 Difference]: Start difference. First operand 27487 states and 34413 transitions. Second operand 14 states. [2018-12-09 16:51:22,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:51:22,781 INFO L93 Difference]: Finished difference Result 54331 states and 69092 transitions. [2018-12-09 16:51:22,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-09 16:51:22,782 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 311 [2018-12-09 16:51:22,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:51:22,826 INFO L225 Difference]: With dead ends: 54331 [2018-12-09 16:51:22,826 INFO L226 Difference]: Without dead ends: 27228 [2018-12-09 16:51:22,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 661 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1658 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=951, Invalid=4451, Unknown=0, NotChecked=0, Total=5402 [2018-12-09 16:51:22,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27228 states. [2018-12-09 16:51:23,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27228 to 20277. [2018-12-09 16:51:23,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20277 states. [2018-12-09 16:51:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20277 states to 20277 states and 24485 transitions. [2018-12-09 16:51:23,173 INFO L78 Accepts]: Start accepts. Automaton has 20277 states and 24485 transitions. Word has length 311 [2018-12-09 16:51:23,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:51:23,174 INFO L480 AbstractCegarLoop]: Abstraction has 20277 states and 24485 transitions. [2018-12-09 16:51:23,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 16:51:23,174 INFO L276 IsEmpty]: Start isEmpty. Operand 20277 states and 24485 transitions. [2018-12-09 16:51:23,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-12-09 16:51:23,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:51:23,177 INFO L402 BasicCegarLoop]: trace histogram [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, 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-12-09 16:51:23,177 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:51:23,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:51:23,177 INFO L82 PathProgramCache]: Analyzing trace with hash -2093022954, now seen corresponding path program 1 times [2018-12-09 16:51:23,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:51:23,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:51:23,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:51:23,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:51:23,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:51:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:51:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 27 proven. 251 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 16:51:23,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:51:23,400 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:51:23,400 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 319 with the following transitions: [2018-12-09 16:51:23,400 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [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], [562], [563], [567], [571], [575], [579], [583], [587], [591], [594], [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], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-09 16:51:23,402 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:51:23,402 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:51:23,694 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:51:23,694 INFO L272 AbstractInterpreter]: Visited 136 different actions 539 times. Merged at 7 different actions 27 times. Never widened. Performed 7440 root evaluator evaluations with a maximum evaluation depth of 14. Performed 7440 inverse root evaluator evaluations with a maximum inverse evaluation depth of 14. Found 7 fixpoints after 3 different actions. Largest state had 28 variables. [2018-12-09 16:51:23,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:51:23,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:51:23,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:51:23,696 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/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-12-09 16:51:23,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:51:23,702 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:51:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:51:23,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:51:23,870 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 196 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-12-09 16:51:23,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:51:24,163 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 196 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-12-09 16:51:24,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:51:24,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 18 [2018-12-09 16:51:24,178 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:51:24,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 16:51:24,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 16:51:24,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-12-09 16:51:24,179 INFO L87 Difference]: Start difference. First operand 20277 states and 24485 transitions. Second operand 16 states. [2018-12-09 16:51:30,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:51:30,786 INFO L93 Difference]: Finished difference Result 40675 states and 52011 transitions. [2018-12-09 16:51:30,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-09 16:51:30,787 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 318 [2018-12-09 16:51:30,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:51:30,826 INFO L225 Difference]: With dead ends: 40675 [2018-12-09 16:51:30,826 INFO L226 Difference]: Without dead ends: 22914 [2018-12-09 16:51:30,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 682 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1608 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=965, Invalid=4291, Unknown=0, NotChecked=0, Total=5256 [2018-12-09 16:51:30,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22914 states. [2018-12-09 16:51:31,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22914 to 21516. [2018-12-09 16:51:31,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21516 states. [2018-12-09 16:51:31,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21516 states to 21516 states and 25907 transitions. [2018-12-09 16:51:31,148 INFO L78 Accepts]: Start accepts. Automaton has 21516 states and 25907 transitions. Word has length 318 [2018-12-09 16:51:31,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:51:31,149 INFO L480 AbstractCegarLoop]: Abstraction has 21516 states and 25907 transitions. [2018-12-09 16:51:31,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 16:51:31,149 INFO L276 IsEmpty]: Start isEmpty. Operand 21516 states and 25907 transitions. [2018-12-09 16:51:31,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-12-09 16:51:31,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:51:31,151 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 16:51:31,152 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:51:31,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:51:31,152 INFO L82 PathProgramCache]: Analyzing trace with hash 12731746, now seen corresponding path program 1 times [2018-12-09 16:51:31,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:51:31,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:51:31,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:51:31,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:51:31,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:51:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:51:31,367 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-12-09 16:51:31,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:51:31,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:51:31,368 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 319 with the following transitions: [2018-12-09 16:51:31,368 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [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], [751], [762], [766], [769], [772], [776], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [870], [874], [878], [889], [893], [897], [901], [905], [909], [913], [924], [928], [932], [936], [940], [944], [948], [952], [956], [960], [971], [975], [979], [983], [987], [991], [994], [999], [1001], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-09 16:51:31,370 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:51:31,370 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:51:31,659 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:51:31,660 INFO L272 AbstractInterpreter]: Visited 186 different actions 731 times. Merged at 6 different actions 20 times. Never widened. Performed 10722 root evaluator evaluations with a maximum evaluation depth of 9. Performed 10722 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 4 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-09 16:51:31,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:51:31,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:51:31,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:51:31,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/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-12-09 16:51:31,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:51:31,669 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:51:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:51:31,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:51:33,432 WARN L180 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2018-12-09 16:51:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-12-09 16:51:33,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:51:33,655 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:33,686 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:33,715 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:33,751 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:33,777 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:33,805 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:33,833 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:33,861 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:33,891 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:33,919 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:33,945 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:33,974 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,003 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,031 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,061 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,097 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,130 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,160 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,192 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,223 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,254 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,285 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,316 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,353 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,388 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,416 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,445 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,475 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,505 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,533 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,561 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,589 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,619 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,648 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,678 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,705 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,734 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,762 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,799 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,830 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,861 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,891 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,918 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,949 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:34,980 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,018 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,056 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,097 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,140 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,184 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,235 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,271 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,304 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,335 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,364 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,395 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,428 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,459 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,488 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,518 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,548 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,579 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,608 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,637 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,664 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,693 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,724 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,753 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,787 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,815 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,844 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,873 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,902 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,931 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,960 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:35,989 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,025 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,053 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,086 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,120 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,150 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,180 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,211 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,239 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,269 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,296 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,325 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,355 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,384 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,449 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,488 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,520 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,548 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,577 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,607 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,636 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,666 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,697 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,724 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,753 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,782 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,811 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,839 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,869 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,898 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,928 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,957 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:36,986 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,026 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,053 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,081 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,112 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,145 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,171 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,199 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,226 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,257 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,289 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,318 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,346 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,375 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,406 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,437 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,465 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,499 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,528 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,556 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,585 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,615 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,645 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,676 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,710 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,750 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,781 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,817 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,851 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,885 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,917 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,948 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:37,978 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,011 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,041 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,069 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,099 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,129 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,159 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,187 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,215 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,246 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,276 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,309 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,344 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,376 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,406 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,438 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,468 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,498 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,527 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,556 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,587 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,618 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,652 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,684 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,717 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,748 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,779 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:38,810 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 16:51:39,598 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 13 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:51:39,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:51:39,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2018-12-09 16:51:39,613 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:51:39,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 16:51:39,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 16:51:39,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2018-12-09 16:51:39,614 INFO L87 Difference]: Start difference. First operand 21516 states and 25907 transitions. Second operand 14 states. [2018-12-09 16:51:41,842 WARN L180 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 35 [2018-12-09 16:51:46,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:51:46,764 INFO L93 Difference]: Finished difference Result 58928 states and 78244 transitions. [2018-12-09 16:51:46,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-09 16:51:46,764 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 318 [2018-12-09 16:51:46,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:51:46,844 INFO L225 Difference]: With dead ends: 58928 [2018-12-09 16:51:46,844 INFO L226 Difference]: Without dead ends: 39548 [2018-12-09 16:51:46,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 459 SyntacticMatches, 169 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1798 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=568, Invalid=1594, Unknown=0, NotChecked=0, Total=2162 [2018-12-09 16:51:46,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39548 states. [2018-12-09 16:51:47,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39548 to 34987. [2018-12-09 16:51:47,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34987 states. [2018-12-09 16:51:47,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34987 states to 34987 states and 42047 transitions. [2018-12-09 16:51:47,459 INFO L78 Accepts]: Start accepts. Automaton has 34987 states and 42047 transitions. Word has length 318 [2018-12-09 16:51:47,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:51:47,459 INFO L480 AbstractCegarLoop]: Abstraction has 34987 states and 42047 transitions. [2018-12-09 16:51:47,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 16:51:47,459 INFO L276 IsEmpty]: Start isEmpty. Operand 34987 states and 42047 transitions. [2018-12-09 16:51:47,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-12-09 16:51:47,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:51:47,463 INFO L402 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-09 16:51:47,463 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:51:47,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:51:47,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1779374113, now seen corresponding path program 1 times [2018-12-09 16:51:47,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:51:47,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:51:47,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:51:47,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:51:47,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:51:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:51:47,570 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-12-09 16:51:47,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:51:47,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:51:47,571 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:51:47,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:51:47,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:51:47,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:51:47,571 INFO L87 Difference]: Start difference. First operand 34987 states and 42047 transitions. Second operand 3 states. [2018-12-09 16:51:48,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:51:48,353 INFO L93 Difference]: Finished difference Result 70751 states and 85221 transitions. [2018-12-09 16:51:48,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:51:48,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2018-12-09 16:51:48,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:51:48,443 INFO L225 Difference]: With dead ends: 70751 [2018-12-09 16:51:48,443 INFO L226 Difference]: Without dead ends: 39312 [2018-12-09 16:51:48,460 INFO L631 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-12-09 16:51:48,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39312 states. [2018-12-09 16:51:48,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39312 to 35928. [2018-12-09 16:51:48,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35928 states. [2018-12-09 16:51:48,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35928 states to 35928 states and 43194 transitions. [2018-12-09 16:51:48,924 INFO L78 Accepts]: Start accepts. Automaton has 35928 states and 43194 transitions. Word has length 329 [2018-12-09 16:51:48,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:51:48,924 INFO L480 AbstractCegarLoop]: Abstraction has 35928 states and 43194 transitions. [2018-12-09 16:51:48,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:51:48,924 INFO L276 IsEmpty]: Start isEmpty. Operand 35928 states and 43194 transitions. [2018-12-09 16:51:48,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-12-09 16:51:48,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:51:48,928 INFO L402 BasicCegarLoop]: trace histogram [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, 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-12-09 16:51:48,928 INFO L423 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:51:48,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:51:48,929 INFO L82 PathProgramCache]: Analyzing trace with hash -92928221, now seen corresponding path program 1 times [2018-12-09 16:51:48,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:51:48,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:51:48,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:51:48,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:51:48,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:51:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:51:49,427 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 28 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:51:49,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:51:49,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:51:49,427 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 334 with the following transitions: [2018-12-09 16:51:49,428 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [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], [594], [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], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-09 16:51:49,429 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:51:49,429 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:51:49,890 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:51:49,890 INFO L272 AbstractInterpreter]: Visited 136 different actions 538 times. Merged at 7 different actions 26 times. Never widened. Performed 7284 root evaluator evaluations with a maximum evaluation depth of 16. Performed 7284 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-12-09 16:51:49,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:51:49,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:51:49,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:51:49,891 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/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-12-09 16:51:49,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:51:49,899 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:51:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:51:49,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:51:56,579 WARN L180 SmtUtils]: Spent 4.55 s on a formula simplification. DAG size of input: 151 DAG size of output: 24 [2018-12-09 16:51:57,932 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 17 proven. 189 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-12-09 16:51:57,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:51:58,299 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 204 proven. 2 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-12-09 16:51:58,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:51:58,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 5] total 24 [2018-12-09 16:51:58,314 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:51:58,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-09 16:51:58,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-09 16:51:58,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=464, Unknown=2, NotChecked=0, Total=552 [2018-12-09 16:51:58,315 INFO L87 Difference]: Start difference. First operand 35928 states and 43194 transitions. Second operand 22 states. [2018-12-09 16:52:01,868 WARN L180 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-12-09 16:52:03,186 WARN L180 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-12-09 16:52:25,372 WARN L180 SmtUtils]: Spent 3.19 s on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2018-12-09 16:53:25,425 WARN L180 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-12-09 16:53:41,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:53:41,392 INFO L93 Difference]: Finished difference Result 78713 states and 96271 transitions. [2018-12-09 16:53:41,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-09 16:53:41,392 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 333 [2018-12-09 16:53:41,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:53:41,455 INFO L225 Difference]: With dead ends: 78713 [2018-12-09 16:53:41,455 INFO L226 Difference]: Without dead ends: 42342 [2018-12-09 16:53:41,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 766 GetRequests, 658 SyntacticMatches, 3 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3790 ImplicationChecksByTransitivity, 31.0s TimeCoverageRelationStatistics Valid=1546, Invalid=9784, Unknown=12, NotChecked=0, Total=11342 [2018-12-09 16:53:41,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42342 states. [2018-12-09 16:53:42,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42342 to 41272. [2018-12-09 16:53:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41272 states. [2018-12-09 16:53:42,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41272 states to 41272 states and 48030 transitions. [2018-12-09 16:53:42,041 INFO L78 Accepts]: Start accepts. Automaton has 41272 states and 48030 transitions. Word has length 333 [2018-12-09 16:53:42,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:53:42,041 INFO L480 AbstractCegarLoop]: Abstraction has 41272 states and 48030 transitions. [2018-12-09 16:53:42,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-09 16:53:42,042 INFO L276 IsEmpty]: Start isEmpty. Operand 41272 states and 48030 transitions. [2018-12-09 16:53:42,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-12-09 16:53:42,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:53:42,045 INFO L402 BasicCegarLoop]: trace histogram [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, 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-12-09 16:53:42,045 INFO L423 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:53:42,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:53:42,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1621015123, now seen corresponding path program 1 times [2018-12-09 16:53:42,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:53:42,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:42,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:53:42,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:42,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:53:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:53:42,171 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 23 proven. 182 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-09 16:53:42,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:53:42,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:53:42,172 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 340 with the following transitions: [2018-12-09 16:53:42,172 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [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], [594], [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], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-09 16:53:42,173 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:53:42,173 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:53:42,440 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:53:42,440 INFO L272 AbstractInterpreter]: Visited 141 different actions 559 times. Merged at 7 different actions 26 times. Never widened. Performed 7849 root evaluator evaluations with a maximum evaluation depth of 13. Performed 7849 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 7 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-09 16:53:42,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:53:42,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:53:42,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:53:42,444 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/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-12-09 16:53:42,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:53:42,450 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:53:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:53:42,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:53:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 201 proven. 2 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-12-09 16:53:45,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:53:45,296 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 119 proven. 94 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-09 16:53:45,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:53:45,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 11 [2018-12-09 16:53:45,311 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:53:45,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 16:53:45,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 16:53:45,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=74, Unknown=2, NotChecked=0, Total=110 [2018-12-09 16:53:45,312 INFO L87 Difference]: Start difference. First operand 41272 states and 48030 transitions. Second operand 9 states. [2018-12-09 16:53:48,624 WARN L180 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2018-12-09 16:54:21,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:54:21,674 INFO L93 Difference]: Finished difference Result 86370 states and 101688 transitions. [2018-12-09 16:54:21,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 16:54:21,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 339 [2018-12-09 16:54:21,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:54:21,746 INFO L225 Difference]: With dead ends: 86370 [2018-12-09 16:54:21,746 INFO L226 Difference]: Without dead ends: 48418 [2018-12-09 16:54:21,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 686 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=159, Invalid=391, Unknown=2, NotChecked=0, Total=552 [2018-12-09 16:54:21,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48418 states. [2018-12-09 16:54:22,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48418 to 46990. [2018-12-09 16:54:22,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46990 states. [2018-12-09 16:54:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46990 states to 46990 states and 53627 transitions. [2018-12-09 16:54:22,443 INFO L78 Accepts]: Start accepts. Automaton has 46990 states and 53627 transitions. Word has length 339 [2018-12-09 16:54:22,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:54:22,443 INFO L480 AbstractCegarLoop]: Abstraction has 46990 states and 53627 transitions. [2018-12-09 16:54:22,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 16:54:22,443 INFO L276 IsEmpty]: Start isEmpty. Operand 46990 states and 53627 transitions. [2018-12-09 16:54:22,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-12-09 16:54:22,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:54:22,446 INFO L402 BasicCegarLoop]: trace histogram [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, 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-12-09 16:54:22,446 INFO L423 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:54:22,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:54:22,446 INFO L82 PathProgramCache]: Analyzing trace with hash 331295927, now seen corresponding path program 1 times [2018-12-09 16:54:22,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:54:22,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:54:22,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:54:22,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:54:22,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:54:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:54:22,689 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 28 proven. 178 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-12-09 16:54:22,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:54:22,689 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:54:22,690 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 354 with the following transitions: [2018-12-09 16:54:22,690 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [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], [594], [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], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-09 16:54:22,691 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:54:22,691 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:54:23,037 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:54:23,037 INFO L272 AbstractInterpreter]: Visited 141 different actions 561 times. Merged at 7 different actions 29 times. Widened at 1 different actions 1 times. Performed 7689 root evaluator evaluations with a maximum evaluation depth of 16. Performed 7689 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-12-09 16:54:23,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:54:23,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:54:23,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:54:23,039 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/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-12-09 16:54:23,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:54:23,045 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:54:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:54:23,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:54:23,213 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 202 proven. 4 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-12-09 16:54:23,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:54:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 17 proven. 189 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-12-09 16:54:23,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:54:23,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2018-12-09 16:54:23,678 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:54:23,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 16:54:23,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 16:54:23,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-12-09 16:54:23,679 INFO L87 Difference]: Start difference. First operand 46990 states and 53627 transitions. Second operand 16 states. [2018-12-09 16:54:27,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:54:27,710 INFO L93 Difference]: Finished difference Result 91857 states and 108936 transitions. [2018-12-09 16:54:27,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-09 16:54:27,711 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 353 [2018-12-09 16:54:27,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:54:27,785 INFO L225 Difference]: With dead ends: 91857 [2018-12-09 16:54:27,786 INFO L226 Difference]: Without dead ends: 48983 [2018-12-09 16:54:27,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 698 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=759, Invalid=2663, Unknown=0, NotChecked=0, Total=3422 [2018-12-09 16:54:27,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48983 states. [2018-12-09 16:54:28,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48983 to 46990. [2018-12-09 16:54:28,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46990 states. [2018-12-09 16:54:28,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46990 states to 46990 states and 53571 transitions. [2018-12-09 16:54:28,475 INFO L78 Accepts]: Start accepts. Automaton has 46990 states and 53571 transitions. Word has length 353 [2018-12-09 16:54:28,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:54:28,476 INFO L480 AbstractCegarLoop]: Abstraction has 46990 states and 53571 transitions. [2018-12-09 16:54:28,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 16:54:28,476 INFO L276 IsEmpty]: Start isEmpty. Operand 46990 states and 53571 transitions. [2018-12-09 16:54:28,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-12-09 16:54:28,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:54:28,479 INFO L402 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-09 16:54:28,480 INFO L423 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:54:28,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:54:28,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1424384412, now seen corresponding path program 1 times [2018-12-09 16:54:28,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:54:28,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:54:28,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:54:28,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:54:28,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:54:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:54:28,868 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 231 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:54:28,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:54:28,869 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:54:28,869 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 376 with the following transitions: [2018-12-09 16:54:28,869 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [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], [594], [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], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-09 16:54:28,870 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:54:28,870 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:54:29,194 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:54:29,195 INFO L272 AbstractInterpreter]: Visited 150 different actions 595 times. Merged at 7 different actions 26 times. Never widened. Performed 8444 root evaluator evaluations with a maximum evaluation depth of 13. Performed 8444 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 7 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-09 16:54:29,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:54:29,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:54:29,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:54:29,197 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/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-12-09 16:54:29,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:54:29,204 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:54:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:54:29,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:54:30,395 WARN L180 SmtUtils]: Spent 977.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 45 [2018-12-09 16:54:30,651 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 143 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:54:30,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:54:31,334 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 231 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:54:31,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:54:31,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 32 [2018-12-09 16:54:31,349 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:54:31,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-09 16:54:31,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-09 16:54:31,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=847, Unknown=0, NotChecked=0, Total=992 [2018-12-09 16:54:31,350 INFO L87 Difference]: Start difference. First operand 46990 states and 53571 transitions. Second operand 25 states. [2018-12-09 16:54:37,000 WARN L180 SmtUtils]: Spent 903.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2018-12-09 16:54:38,470 WARN L180 SmtUtils]: Spent 912.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2018-12-09 16:54:41,459 WARN L180 SmtUtils]: Spent 910.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2018-12-09 16:54:42,630 WARN L180 SmtUtils]: Spent 928.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2018-12-09 16:54:46,476 WARN L180 SmtUtils]: Spent 881.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2018-12-09 16:54:47,507 WARN L180 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2018-12-09 16:54:51,181 WARN L180 SmtUtils]: Spent 859.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2018-12-09 16:54:52,054 WARN L180 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2018-12-09 16:54:54,679 WARN L180 SmtUtils]: Spent 876.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2018-12-09 16:54:59,075 WARN L180 SmtUtils]: Spent 898.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2018-12-09 16:54:59,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:54:59,766 INFO L93 Difference]: Finished difference Result 92765 states and 110316 transitions. [2018-12-09 16:54:59,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-12-09 16:54:59,766 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 375 [2018-12-09 16:54:59,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:54:59,856 INFO L225 Difference]: With dead ends: 92765 [2018-12-09 16:54:59,856 INFO L226 Difference]: Without dead ends: 49671 [2018-12-09 16:54:59,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 746 SyntacticMatches, 4 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10188 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=4351, Invalid=23039, Unknown=0, NotChecked=0, Total=27390 [2018-12-09 16:54:59,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49671 states. [2018-12-09 16:55:00,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49671 to 47418. [2018-12-09 16:55:00,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47418 states. [2018-12-09 16:55:00,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47418 states to 47418 states and 53919 transitions. [2018-12-09 16:55:00,674 INFO L78 Accepts]: Start accepts. Automaton has 47418 states and 53919 transitions. Word has length 375 [2018-12-09 16:55:00,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:00,674 INFO L480 AbstractCegarLoop]: Abstraction has 47418 states and 53919 transitions. [2018-12-09 16:55:00,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-09 16:55:00,674 INFO L276 IsEmpty]: Start isEmpty. Operand 47418 states and 53919 transitions. [2018-12-09 16:55:00,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-12-09 16:55:00,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:00,678 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2018-12-09 16:55:00,678 INFO L423 AbstractCegarLoop]: === Iteration 22 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:55:00,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:00,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1038295940, now seen corresponding path program 1 times [2018-12-09 16:55:00,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:55:00,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:00,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:00,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:00,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:55:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:00,802 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 200 proven. 87 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-09 16:55:00,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:55:00,802 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:55:00,802 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 394 with the following transitions: [2018-12-09 16:55:00,802 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [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], [554], [555], [559], [563], [566], [567], [571], [575], [579], [583], [587], [591], [594], [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], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-09 16:55:00,804 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:55:00,804 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:55:01,141 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:55:01,141 INFO L272 AbstractInterpreter]: Visited 127 different actions 508 times. Merged at 8 different actions 32 times. Never widened. Performed 6854 root evaluator evaluations with a maximum evaluation depth of 16. Performed 6854 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 10 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-09 16:55:01,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:01,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:55:01,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:55:01,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:55:01,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:01,151 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:55:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:01,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:55:01,263 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 289 proven. 2 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-12-09 16:55:01,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:55:01,452 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 289 proven. 2 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-12-09 16:55:01,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:55:01,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-12-09 16:55:01,467 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:55:01,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 16:55:01,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 16:55:01,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-09 16:55:01,468 INFO L87 Difference]: Start difference. First operand 47418 states and 53919 transitions. Second operand 9 states. [2018-12-09 16:55:06,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:06,041 INFO L93 Difference]: Finished difference Result 110485 states and 126568 transitions. [2018-12-09 16:55:06,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-09 16:55:06,041 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 393 [2018-12-09 16:55:06,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:06,129 INFO L225 Difference]: With dead ends: 110485 [2018-12-09 16:55:06,129 INFO L226 Difference]: Without dead ends: 61897 [2018-12-09 16:55:06,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 847 GetRequests, 810 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=315, Invalid=1167, Unknown=0, NotChecked=0, Total=1482 [2018-12-09 16:55:06,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61897 states. [2018-12-09 16:55:06,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61897 to 51080. [2018-12-09 16:55:06,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51080 states. [2018-12-09 16:55:06,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51080 states to 51080 states and 56997 transitions. [2018-12-09 16:55:06,959 INFO L78 Accepts]: Start accepts. Automaton has 51080 states and 56997 transitions. Word has length 393 [2018-12-09 16:55:06,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:06,959 INFO L480 AbstractCegarLoop]: Abstraction has 51080 states and 56997 transitions. [2018-12-09 16:55:06,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 16:55:06,959 INFO L276 IsEmpty]: Start isEmpty. Operand 51080 states and 56997 transitions. [2018-12-09 16:55:06,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-12-09 16:55:06,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:06,964 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 1, 1] [2018-12-09 16:55:06,964 INFO L423 AbstractCegarLoop]: === Iteration 23 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:55:06,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:06,965 INFO L82 PathProgramCache]: Analyzing trace with hash -480737097, now seen corresponding path program 1 times [2018-12-09 16:55:06,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:55:06,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:06,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:06,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:06,965 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:55:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:07,149 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-12-09 16:55:07,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:07,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:55:07,150 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:55:07,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:55:07,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:55:07,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:55:07,150 INFO L87 Difference]: Start difference. First operand 51080 states and 56997 transitions. Second operand 3 states. [2018-12-09 16:55:08,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:08,256 INFO L93 Difference]: Finished difference Result 102062 states and 114194 transitions. [2018-12-09 16:55:08,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:55:08,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 419 [2018-12-09 16:55:08,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:08,335 INFO L225 Difference]: With dead ends: 102062 [2018-12-09 16:55:08,336 INFO L226 Difference]: Without dead ends: 54866 [2018-12-09 16:55:08,374 INFO L631 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-12-09 16:55:08,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54866 states. [2018-12-09 16:55:09,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54866 to 51476. [2018-12-09 16:55:09,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51476 states. [2018-12-09 16:55:09,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51476 states to 51476 states and 57397 transitions. [2018-12-09 16:55:09,122 INFO L78 Accepts]: Start accepts. Automaton has 51476 states and 57397 transitions. Word has length 419 [2018-12-09 16:55:09,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:09,123 INFO L480 AbstractCegarLoop]: Abstraction has 51476 states and 57397 transitions. [2018-12-09 16:55:09,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:55:09,123 INFO L276 IsEmpty]: Start isEmpty. Operand 51476 states and 57397 transitions. [2018-12-09 16:55:09,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-12-09 16:55:09,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:09,129 INFO L402 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-09 16:55:09,129 INFO L423 AbstractCegarLoop]: === Iteration 24 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:55:09,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:09,129 INFO L82 PathProgramCache]: Analyzing trace with hash -2064294615, now seen corresponding path program 1 times [2018-12-09 16:55:09,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:55:09,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:09,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:09,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:09,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:55:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:09,407 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 165 proven. 183 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 16:55:09,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:55:09,407 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:55:09,408 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 420 with the following transitions: [2018-12-09 16:55:09,408 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [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], [594], [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], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-09 16:55:09,409 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:55:09,410 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:55:15,526 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:55:15,526 INFO L272 AbstractInterpreter]: Visited 176 different actions 524 times. Merged at 7 different actions 18 times. Never widened. Performed 7374 root evaluator evaluations with a maximum evaluation depth of 23. Performed 7374 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-12-09 16:55:15,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:15,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:55:15,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:55:15,528 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:55:15,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:15,534 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:55:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:15,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:55:16,425 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_~a29~0_797 Int)) (let ((.cse1 (+ v_~a29~0_797 69157))) (let ((.cse0 (mod .cse1 299861))) (and (not (= 0 .cse0)) (<= |c_old(~a29~0)| v_~a29~0_797) (<= c_~a29~0 (+ .cse0 277)) (< .cse1 0))))) (exists ((v_prenex_439 Int)) (let ((.cse2 (+ v_prenex_439 69157))) (and (<= 0 .cse2) (<= |c_old(~a29~0)| v_prenex_439) (<= c_~a29~0 (+ (mod .cse2 299861) 300138))))) (exists ((v_prenex_440 Int)) (let ((.cse3 (mod (+ v_prenex_440 69157) 299861))) (and (<= |c_old(~a29~0)| v_prenex_440) (<= c_~a29~0 (+ .cse3 300138)) (= 0 .cse3))))) is different from true [2018-12-09 16:55:16,635 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 109 proven. 237 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-12-09 16:55:16,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:55:17,146 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 252 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:55:17,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:55:17,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 8] total 25 [2018-12-09 16:55:17,162 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:55:17,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 16:55:17,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 16:55:17,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=462, Unknown=1, NotChecked=44, Total=600 [2018-12-09 16:55:17,162 INFO L87 Difference]: Start difference. First operand 51476 states and 57397 transitions. Second operand 20 states. [2018-12-09 16:55:20,337 WARN L180 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 51 DAG size of output: 17 [2018-12-09 16:55:33,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:33,296 INFO L93 Difference]: Finished difference Result 105076 states and 118940 transitions. [2018-12-09 16:55:33,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-09 16:55:33,297 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 419 [2018-12-09 16:55:33,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:33,391 INFO L225 Difference]: With dead ends: 105076 [2018-12-09 16:55:33,391 INFO L226 Difference]: Without dead ends: 57294 [2018-12-09 16:55:33,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 927 GetRequests, 827 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2928 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=1496, Invalid=7818, Unknown=2, NotChecked=190, Total=9506 [2018-12-09 16:55:33,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57294 states. [2018-12-09 16:55:34,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57294 to 54339. [2018-12-09 16:55:34,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54339 states. [2018-12-09 16:55:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54339 states to 54339 states and 60416 transitions. [2018-12-09 16:55:34,350 INFO L78 Accepts]: Start accepts. Automaton has 54339 states and 60416 transitions. Word has length 419 [2018-12-09 16:55:34,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:34,350 INFO L480 AbstractCegarLoop]: Abstraction has 54339 states and 60416 transitions. [2018-12-09 16:55:34,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 16:55:34,350 INFO L276 IsEmpty]: Start isEmpty. Operand 54339 states and 60416 transitions. [2018-12-09 16:55:34,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-12-09 16:55:34,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:34,356 INFO L402 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-09 16:55:34,356 INFO L423 AbstractCegarLoop]: === Iteration 25 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:55:34,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:34,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1636159661, now seen corresponding path program 1 times [2018-12-09 16:55:34,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:55:34,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:34,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:34,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:34,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:55:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 16:55:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 16:55:34,489 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 16:55:34,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:55:34 BoogieIcfgContainer [2018-12-09 16:55:34,596 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 16:55:34,596 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 16:55:34,596 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 16:55:34,597 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 16:55:34,597 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:48:15" (3/4) ... [2018-12-09 16:55:34,599 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 16:55:34,703 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6a3f5ab8-2e74-4b55-9da6-35e190071c62/bin-2019/utaipan/witness.graphml [2018-12-09 16:55:34,703 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 16:55:34,704 INFO L168 Benchmark]: Toolchain (without parser) took 440243.06 ms. Allocated memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: 2.8 GB). Free memory was 940.6 MB in the beginning and 2.9 GB in the end (delta: -2.0 GB). Peak memory consumption was 822.5 MB. Max. memory is 11.5 GB. [2018-12-09 16:55:34,704 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:55:34,705 INFO L168 Benchmark]: CACSL2BoogieTranslator took 416.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -151.5 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. [2018-12-09 16:55:34,705 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:55:34,705 INFO L168 Benchmark]: Boogie Preprocessor took 48.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 16:55:34,705 INFO L168 Benchmark]: RCFGBuilder took 1013.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 912.6 MB in the end (delta: 168.7 MB). Peak memory consumption was 168.7 MB. Max. memory is 11.5 GB. [2018-12-09 16:55:34,706 INFO L168 Benchmark]: TraceAbstraction took 438633.47 ms. Allocated memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: 2.7 GB). Free memory was 912.6 MB in the beginning and 3.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 624.8 MB. Max. memory is 11.5 GB. [2018-12-09 16:55:34,706 INFO L168 Benchmark]: Witness Printer took 106.53 ms. Allocated memory is still 3.8 GB. Free memory was 3.0 GB in the beginning and 2.9 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB. [2018-12-09 16:55:34,707 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 416.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -151.5 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1013.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 912.6 MB in the end (delta: 168.7 MB). Peak memory consumption was 168.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 438633.47 ms. Allocated memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: 2.7 GB). Free memory was 912.6 MB in the beginning and 3.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 624.8 MB. Max. memory is 11.5 GB. * Witness Printer took 106.53 ms. Allocated memory is still 3.8 GB. Free memory was 3.0 GB in the beginning and 2.9 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 24]: 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] 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] RET, 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] 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] RET, 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=3, 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)=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, 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)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L358] COND TRUE ((((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)) [L359] a29 = (((a29 / 5) + -137957) * 2) [L360] a23 = ((((a23 - 0) / 5) / 5) + -127612) [L361] a4 = 1 [L362] a25 = 10 [L364] return -1; VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, \result=-1, a23=-127600, a25=10, a29=-193244, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1042] RET, EXPR calculate_output(input) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, a23=-127600, a25=10, a29=-193244, a3=1, a4=1, a8=15, calculate_output(input)=-1, input=3, 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=-127600, a25=10, a29=-193244, a3=1, a4=1, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L1042] CALL calculate_output(input) VAL [\old(a23)=-127600, \old(a25)=10, \old(a29)=-193244, \old(a4)=1, \old(input)=1, a23=-127600, a25=10, a29=-193244, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L23] COND TRUE ((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15)) VAL [\old(a23)=-127600, \old(a25)=10, \old(a29)=-193244, \old(a4)=1, \old(input)=1, a23=-127600, a25=10, a29=-193244, a3=1, a4=1, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] __VERIFIER_error() VAL [\old(a23)=-127600, \old(a25)=10, \old(a29)=-193244, \old(a4)=1, \old(input)=1, a23=-127600, a25=10, a29=-193244, a3=1, a4=1, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 292 locations, 1 error locations. UNSAFE Result, 438.5s OverallTime, 25 OverallIterations, 5 TraceHistogramMax, 382.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2912 SDtfs, 51042 SDslu, 6677 SDs, 0 SdLazy, 90215 SolverSat, 20968 SolverUnsat, 125 SolverUnknown, 0 SolverNotchecked, 268.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10668 GetRequests, 9342 SyntacticMatches, 209 SemanticMatches, 1117 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35415 ImplicationChecksByTransitivity, 114.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54339occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 11.1s AbstIntTime, 16 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 50339 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 32.5s InterpolantComputationTime, 11073 NumberOfCodeBlocks, 11073 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 15293 ConstructedInterpolants, 357 QuantifiedInterpolants, 43540949 SizeOfPredicates, 59 NumberOfNonLiveVariables, 8319 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 56 InterpolantComputations, 10 PerfectInterpolantSequences, 7609/11105 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...