./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label31.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d8544ace-93fa-4fe3-8e03-eabefe7d400f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d8544ace-93fa-4fe3-8e03-eabefe7d400f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d8544ace-93fa-4fe3-8e03-eabefe7d400f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d8544ace-93fa-4fe3-8e03-eabefe7d400f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label31.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d8544ace-93fa-4fe3-8e03-eabefe7d400f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d8544ace-93fa-4fe3-8e03-eabefe7d400f/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash badb5e839449e413568df201e281c68f67c56eac .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 01:43:33,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:43:33,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:43:33,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:43:33,019 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:43:33,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:43:33,021 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:43:33,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:43:33,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:43:33,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:43:33,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:43:33,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:43:33,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:43:33,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:43:33,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:43:33,031 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:43:33,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:43:33,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:43:33,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:43:33,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:43:33,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:43:33,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:43:33,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:43:33,040 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:43:33,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:43:33,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:43:33,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:43:33,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:43:33,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:43:33,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:43:33,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:43:33,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:43:33,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:43:33,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:43:33,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:43:33,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:43:33,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:43:33,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:43:33,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:43:33,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:43:33,050 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:43:33,051 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d8544ace-93fa-4fe3-8e03-eabefe7d400f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 01:43:33,063 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:43:33,064 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:43:33,065 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:43:33,065 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:43:33,065 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:43:33,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:43:33,065 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:43:33,066 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 01:43:33,066 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:43:33,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:43:33,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 01:43:33,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:43:33,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 01:43:33,067 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:43:33,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:43:33,067 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:43:33,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 01:43:33,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:43:33,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:43:33,068 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:43:33,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 01:43:33,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:43:33,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:43:33,068 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:43:33,069 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 01:43:33,069 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 01:43:33,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 01:43:33,069 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 01:43:33,069 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_d8544ace-93fa-4fe3-8e03-eabefe7d400f/bin/uautomizer 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> badb5e839449e413568df201e281c68f67c56eac [2019-11-20 01:43:33,208 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:43:33,219 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:43:33,222 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:43:33,223 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:43:33,224 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:43:33,225 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d8544ace-93fa-4fe3-8e03-eabefe7d400f/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label31.c [2019-11-20 01:43:33,287 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d8544ace-93fa-4fe3-8e03-eabefe7d400f/bin/uautomizer/data/1aa6dba25/1bd268aef173420fa095cb90af388ef7/FLAGda024fd7b [2019-11-20 01:43:33,797 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:43:33,798 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d8544ace-93fa-4fe3-8e03-eabefe7d400f/sv-benchmarks/c/eca-rers2012/Problem11_label31.c [2019-11-20 01:43:33,811 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d8544ace-93fa-4fe3-8e03-eabefe7d400f/bin/uautomizer/data/1aa6dba25/1bd268aef173420fa095cb90af388ef7/FLAGda024fd7b [2019-11-20 01:43:34,110 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d8544ace-93fa-4fe3-8e03-eabefe7d400f/bin/uautomizer/data/1aa6dba25/1bd268aef173420fa095cb90af388ef7 [2019-11-20 01:43:34,113 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:43:34,114 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:43:34,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:43:34,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:43:34,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:43:34,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:43:34" (1/1) ... [2019-11-20 01:43:34,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26e22ca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:43:34, skipping insertion in model container [2019-11-20 01:43:34,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:43:34" (1/1) ... [2019-11-20 01:43:34,132 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:43:34,204 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:43:34,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:43:34,881 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:43:35,039 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:43:35,057 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:43:35,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:43:35 WrapperNode [2019-11-20 01:43:35,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:43:35,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:43:35,060 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:43:35,060 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:43:35,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:43:35" (1/1) ... [2019-11-20 01:43:35,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:43:35" (1/1) ... [2019-11-20 01:43:35,203 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:43:35,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:43:35,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:43:35,204 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:43:35,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:43:35" (1/1) ... [2019-11-20 01:43:35,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:43:35" (1/1) ... [2019-11-20 01:43:35,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:43:35" (1/1) ... [2019-11-20 01:43:35,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:43:35" (1/1) ... [2019-11-20 01:43:35,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:43:35" (1/1) ... [2019-11-20 01:43:35,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:43:35" (1/1) ... [2019-11-20 01:43:35,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:43:35" (1/1) ... [2019-11-20 01:43:35,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:43:35,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:43:35,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:43:35,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:43:35,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:43:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d8544ace-93fa-4fe3-8e03-eabefe7d400f/bin/uautomizer/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 [2019-11-20 01:43:35,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:43:35,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:43:37,175 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:43:37,176 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 01:43:37,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:43:37 BoogieIcfgContainer [2019-11-20 01:43:37,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:43:37,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 01:43:37,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 01:43:37,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 01:43:37,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:43:34" (1/3) ... [2019-11-20 01:43:37,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@534d114f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:43:37, skipping insertion in model container [2019-11-20 01:43:37,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:43:35" (2/3) ... [2019-11-20 01:43:37,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@534d114f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:43:37, skipping insertion in model container [2019-11-20 01:43:37,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:43:37" (3/3) ... [2019-11-20 01:43:37,188 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label31.c [2019-11-20 01:43:37,198 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 01:43:37,206 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 01:43:37,216 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 01:43:37,250 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 01:43:37,250 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 01:43:37,250 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 01:43:37,251 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:43:37,251 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:43:37,251 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 01:43:37,251 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:43:37,252 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 01:43:37,277 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-20 01:43:37,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-20 01:43:37,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:43:37,283 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:43:37,284 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:43:37,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:43:37,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1810726993, now seen corresponding path program 1 times [2019-11-20 01:43:37,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:43:37,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643787767] [2019-11-20 01:43:37,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:43:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:43:37,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:43:37,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643787767] [2019-11-20 01:43:37,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:43:37,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:43:37,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977160121] [2019-11-20 01:43:37,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:43:37,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:43:37,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:43:37,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:43:37,479 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 3 states. [2019-11-20 01:43:38,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:43:38,999 INFO L93 Difference]: Finished difference Result 761 states and 1345 transitions. [2019-11-20 01:43:38,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:43:39,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-20 01:43:39,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:43:39,024 INFO L225 Difference]: With dead ends: 761 [2019-11-20 01:43:39,024 INFO L226 Difference]: Without dead ends: 413 [2019-11-20 01:43:39,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:43:39,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-11-20 01:43:39,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2019-11-20 01:43:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-11-20 01:43:39,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2019-11-20 01:43:39,120 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 7 [2019-11-20 01:43:39,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:43:39,120 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2019-11-20 01:43:39,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:43:39,120 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2019-11-20 01:43:39,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 01:43:39,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:43:39,124 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 01:43:39,125 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:43:39,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:43:39,126 INFO L82 PathProgramCache]: Analyzing trace with hash 31514424, now seen corresponding path program 1 times [2019-11-20 01:43:39,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:43:39,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510808978] [2019-11-20 01:43:39,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:43:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:43:39,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:43:39,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510808978] [2019-11-20 01:43:39,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:43:39,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:43:39,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588412609] [2019-11-20 01:43:39,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:43:39,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:43:39,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:43:39,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:43:39,396 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand 4 states. [2019-11-20 01:43:41,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:43:41,079 INFO L93 Difference]: Finished difference Result 1583 states and 2309 transitions. [2019-11-20 01:43:41,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:43:41,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-20 01:43:41,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:43:41,088 INFO L225 Difference]: With dead ends: 1583 [2019-11-20 01:43:41,088 INFO L226 Difference]: Without dead ends: 1172 [2019-11-20 01:43:41,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:43:41,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2019-11-20 01:43:41,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1155. [2019-11-20 01:43:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2019-11-20 01:43:41,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1576 transitions. [2019-11-20 01:43:41,133 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1576 transitions. Word has length 75 [2019-11-20 01:43:41,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:43:41,134 INFO L462 AbstractCegarLoop]: Abstraction has 1155 states and 1576 transitions. [2019-11-20 01:43:41,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:43:41,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1576 transitions. [2019-11-20 01:43:41,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 01:43:41,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:43:41,138 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 01:43:41,138 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:43:41,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:43:41,138 INFO L82 PathProgramCache]: Analyzing trace with hash -204707764, now seen corresponding path program 1 times [2019-11-20 01:43:41,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:43:41,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480031075] [2019-11-20 01:43:41,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:43:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:43:41,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:43:41,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480031075] [2019-11-20 01:43:41,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:43:41,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:43:41,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124365841] [2019-11-20 01:43:41,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:43:41,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:43:41,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:43:41,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:43:41,362 INFO L87 Difference]: Start difference. First operand 1155 states and 1576 transitions. Second operand 4 states. [2019-11-20 01:43:42,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:43:42,981 INFO L93 Difference]: Finished difference Result 4161 states and 5754 transitions. [2019-11-20 01:43:42,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:43:42,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-11-20 01:43:42,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:43:42,998 INFO L225 Difference]: With dead ends: 4161 [2019-11-20 01:43:42,998 INFO L226 Difference]: Without dead ends: 3008 [2019-11-20 01:43:43,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:43:43,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2019-11-20 01:43:43,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 2260. [2019-11-20 01:43:43,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2260 states. [2019-11-20 01:43:43,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 2830 transitions. [2019-11-20 01:43:43,056 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 2830 transitions. Word has length 83 [2019-11-20 01:43:43,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:43:43,058 INFO L462 AbstractCegarLoop]: Abstraction has 2260 states and 2830 transitions. [2019-11-20 01:43:43,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:43:43,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 2830 transitions. [2019-11-20 01:43:43,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-20 01:43:43,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:43:43,076 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 01:43:43,077 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:43:43,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:43:43,077 INFO L82 PathProgramCache]: Analyzing trace with hash -2102130595, now seen corresponding path program 1 times [2019-11-20 01:43:43,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:43:43,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38122134] [2019-11-20 01:43:43,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:43:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:43:43,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:43:43,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38122134] [2019-11-20 01:43:43,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:43:43,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:43:43,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484958778] [2019-11-20 01:43:43,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:43:43,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:43:43,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:43:43,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:43:43,259 INFO L87 Difference]: Start difference. First operand 2260 states and 2830 transitions. Second operand 3 states. [2019-11-20 01:43:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:43:44,151 INFO L93 Difference]: Finished difference Result 5082 states and 6431 transitions. [2019-11-20 01:43:44,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:43:44,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-11-20 01:43:44,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:43:44,169 INFO L225 Difference]: With dead ends: 5082 [2019-11-20 01:43:44,170 INFO L226 Difference]: Without dead ends: 3008 [2019-11-20 01:43:44,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:43:44,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2019-11-20 01:43:44,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 2814. [2019-11-20 01:43:44,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2814 states. [2019-11-20 01:43:44,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2814 states and 3454 transitions. [2019-11-20 01:43:44,236 INFO L78 Accepts]: Start accepts. Automaton has 2814 states and 3454 transitions. Word has length 134 [2019-11-20 01:43:44,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:43:44,237 INFO L462 AbstractCegarLoop]: Abstraction has 2814 states and 3454 transitions. [2019-11-20 01:43:44,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:43:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 3454 transitions. [2019-11-20 01:43:44,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-20 01:43:44,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:43:44,241 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:43:44,241 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:43:44,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:43:44,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1571845931, now seen corresponding path program 1 times [2019-11-20 01:43:44,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:43:44,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933505022] [2019-11-20 01:43:44,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:43:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:43:44,441 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-11-20 01:43:44,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933505022] [2019-11-20 01:43:44,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:43:44,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:43:44,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262163707] [2019-11-20 01:43:44,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:43:44,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:43:44,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:43:44,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:43:44,444 INFO L87 Difference]: Start difference. First operand 2814 states and 3454 transitions. Second operand 3 states. [2019-11-20 01:43:45,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:43:45,375 INFO L93 Difference]: Finished difference Result 6004 states and 7480 transitions. [2019-11-20 01:43:45,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:43:45,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-11-20 01:43:45,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:43:45,392 INFO L225 Difference]: With dead ends: 6004 [2019-11-20 01:43:45,392 INFO L226 Difference]: Without dead ends: 3376 [2019-11-20 01:43:45,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:43:45,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3376 states. [2019-11-20 01:43:45,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3376 to 3366. [2019-11-20 01:43:45,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3366 states. [2019-11-20 01:43:45,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3366 states to 3366 states and 4102 transitions. [2019-11-20 01:43:45,469 INFO L78 Accepts]: Start accepts. Automaton has 3366 states and 4102 transitions. Word has length 188 [2019-11-20 01:43:45,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:43:45,470 INFO L462 AbstractCegarLoop]: Abstraction has 3366 states and 4102 transitions. [2019-11-20 01:43:45,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:43:45,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3366 states and 4102 transitions. [2019-11-20 01:43:45,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-20 01:43:45,475 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:43:45,476 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:43:45,476 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:43:45,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:43:45,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1014653344, now seen corresponding path program 1 times [2019-11-20 01:43:45,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:43:45,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612872632] [2019-11-20 01:43:45,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:43:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:43:45,892 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 75 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:43:45,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612872632] [2019-11-20 01:43:45,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257785407] [2019-11-20 01:43:45,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d8544ace-93fa-4fe3-8e03-eabefe7d400f/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:43:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:43:45,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 01:43:46,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:43:46,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:43:46,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:43:46,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:43:46,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:43:46,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:43:46,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:43:46,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:43:46,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:43:46,878 WARN L191 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 29 [2019-11-20 01:43:47,279 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:43:47,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:43:47,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2019-11-20 01:43:47,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483638747] [2019-11-20 01:43:47,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 01:43:47,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:43:47,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 01:43:47,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-20 01:43:47,282 INFO L87 Difference]: Start difference. First operand 3366 states and 4102 transitions. Second operand 9 states. [2019-11-20 01:43:56,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:43:56,279 INFO L93 Difference]: Finished difference Result 16138 states and 20465 transitions. [2019-11-20 01:43:56,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-20 01:43:56,280 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 189 [2019-11-20 01:43:56,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:43:56,351 INFO L225 Difference]: With dead ends: 16138 [2019-11-20 01:43:56,351 INFO L226 Difference]: Without dead ends: 12774 [2019-11-20 01:43:56,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2019-11-20 01:43:56,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12774 states. [2019-11-20 01:43:56,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12774 to 8525. [2019-11-20 01:43:56,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8525 states. [2019-11-20 01:43:56,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8525 states to 8525 states and 9884 transitions. [2019-11-20 01:43:56,546 INFO L78 Accepts]: Start accepts. Automaton has 8525 states and 9884 transitions. Word has length 189 [2019-11-20 01:43:56,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:43:56,547 INFO L462 AbstractCegarLoop]: Abstraction has 8525 states and 9884 transitions. [2019-11-20 01:43:56,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 01:43:56,547 INFO L276 IsEmpty]: Start isEmpty. Operand 8525 states and 9884 transitions. [2019-11-20 01:43:56,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-20 01:43:56,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:43:56,551 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:43:56,756 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:43:56,757 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:43:56,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:43:56,757 INFO L82 PathProgramCache]: Analyzing trace with hash 429301753, now seen corresponding path program 1 times [2019-11-20 01:43:56,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:43:56,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476994028] [2019-11-20 01:43:56,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:43:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:43:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-20 01:43:56,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476994028] [2019-11-20 01:43:56,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:43:56,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:43:56,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519142293] [2019-11-20 01:43:56,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:43:56,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:43:56,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:43:56,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:43:56,903 INFO L87 Difference]: Start difference. First operand 8525 states and 9884 transitions. Second operand 3 states. [2019-11-20 01:43:57,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:43:57,633 INFO L93 Difference]: Finished difference Result 18152 states and 21051 transitions. [2019-11-20 01:43:57,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:43:57,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-11-20 01:43:57,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:43:57,671 INFO L225 Difference]: With dead ends: 18152 [2019-11-20 01:43:57,672 INFO L226 Difference]: Without dead ends: 9629 [2019-11-20 01:43:57,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:43:57,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9629 states. [2019-11-20 01:43:57,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9629 to 8893. [2019-11-20 01:43:57,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8893 states. [2019-11-20 01:43:57,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8893 states to 8893 states and 10270 transitions. [2019-11-20 01:43:57,833 INFO L78 Accepts]: Start accepts. Automaton has 8893 states and 10270 transitions. Word has length 199 [2019-11-20 01:43:57,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:43:57,834 INFO L462 AbstractCegarLoop]: Abstraction has 8893 states and 10270 transitions. [2019-11-20 01:43:57,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:43:57,834 INFO L276 IsEmpty]: Start isEmpty. Operand 8893 states and 10270 transitions. [2019-11-20 01:43:57,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-20 01:43:57,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:43:57,838 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:43:57,838 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:43:57,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:43:57,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1714515319, now seen corresponding path program 1 times [2019-11-20 01:43:57,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:43:57,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174414400] [2019-11-20 01:43:57,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:43:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:43:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:43:58,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174414400] [2019-11-20 01:43:58,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:43:58,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:43:58,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208585442] [2019-11-20 01:43:58,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:43:58,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:43:58,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:43:58,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:43:58,017 INFO L87 Difference]: Start difference. First operand 8893 states and 10270 transitions. Second operand 4 states. [2019-11-20 01:43:59,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:43:59,334 INFO L93 Difference]: Finished difference Result 18536 states and 21527 transitions. [2019-11-20 01:43:59,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:43:59,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-11-20 01:43:59,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:43:59,353 INFO L225 Difference]: With dead ends: 18536 [2019-11-20 01:43:59,354 INFO L226 Difference]: Without dead ends: 9645 [2019-11-20 01:43:59,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:43:59,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9645 states. [2019-11-20 01:43:59,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9645 to 9265. [2019-11-20 01:43:59,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9265 states. [2019-11-20 01:43:59,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9265 states to 9265 states and 10660 transitions. [2019-11-20 01:43:59,620 INFO L78 Accepts]: Start accepts. Automaton has 9265 states and 10660 transitions. Word has length 204 [2019-11-20 01:43:59,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:43:59,621 INFO L462 AbstractCegarLoop]: Abstraction has 9265 states and 10660 transitions. [2019-11-20 01:43:59,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:43:59,621 INFO L276 IsEmpty]: Start isEmpty. Operand 9265 states and 10660 transitions. [2019-11-20 01:43:59,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-20 01:43:59,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:43:59,625 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:43:59,625 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:43:59,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:43:59,626 INFO L82 PathProgramCache]: Analyzing trace with hash -293367705, now seen corresponding path program 1 times [2019-11-20 01:43:59,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:43:59,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271961399] [2019-11-20 01:43:59,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:43:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:43:59,857 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 75 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:43:59,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271961399] [2019-11-20 01:43:59,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439398198] [2019-11-20 01:43:59,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d8544ace-93fa-4fe3-8e03-eabefe7d400f/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:43:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:43:59,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 01:43:59,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:44:00,058 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:44:00,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 01:44:00,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-20 01:44:00,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762858968] [2019-11-20 01:44:00,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:44:00,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:44:00,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:44:00,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:44:00,060 INFO L87 Difference]: Start difference. First operand 9265 states and 10660 transitions. Second operand 4 states. [2019-11-20 01:44:01,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:44:01,561 INFO L93 Difference]: Finished difference Result 19456 states and 22448 transitions. [2019-11-20 01:44:01,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:44:01,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2019-11-20 01:44:01,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:44:01,585 INFO L225 Difference]: With dead ends: 19456 [2019-11-20 01:44:01,585 INFO L226 Difference]: Without dead ends: 10193 [2019-11-20 01:44:01,594 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:44:01,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10193 states. [2019-11-20 01:44:01,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10193 to 8345. [2019-11-20 01:44:01,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8345 states. [2019-11-20 01:44:01,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8345 states to 8345 states and 9523 transitions. [2019-11-20 01:44:01,707 INFO L78 Accepts]: Start accepts. Automaton has 8345 states and 9523 transitions. Word has length 220 [2019-11-20 01:44:01,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:44:01,708 INFO L462 AbstractCegarLoop]: Abstraction has 8345 states and 9523 transitions. [2019-11-20 01:44:01,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:44:01,708 INFO L276 IsEmpty]: Start isEmpty. Operand 8345 states and 9523 transitions. [2019-11-20 01:44:01,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-20 01:44:01,713 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:44:01,713 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:44:01,925 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:44:01,926 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:44:01,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:44:01,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1778378895, now seen corresponding path program 1 times [2019-11-20 01:44:01,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:44:01,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436754076] [2019-11-20 01:44:01,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:44:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:44:02,522 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 74 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:44:02,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436754076] [2019-11-20 01:44:02,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466207320] [2019-11-20 01:44:02,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d8544ace-93fa-4fe3-8e03-eabefe7d400f/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:44:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:44:02,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 01:44:02,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:44:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:44:02,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:44:02,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2019-11-20 01:44:02,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375992182] [2019-11-20 01:44:02,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 01:44:02,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:44:02,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 01:44:02,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:44:02,936 INFO L87 Difference]: Start difference. First operand 8345 states and 9523 transitions. Second operand 10 states. [2019-11-20 01:44:09,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:44:09,715 INFO L93 Difference]: Finished difference Result 20619 states and 23341 transitions. [2019-11-20 01:44:09,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-20 01:44:09,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 244 [2019-11-20 01:44:09,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:44:09,738 INFO L225 Difference]: With dead ends: 20619 [2019-11-20 01:44:09,738 INFO L226 Difference]: Without dead ends: 12276 [2019-11-20 01:44:09,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-11-20 01:44:09,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12276 states. [2019-11-20 01:44:09,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12276 to 9453. [2019-11-20 01:44:09,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9453 states. [2019-11-20 01:44:09,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9453 states to 9453 states and 10731 transitions. [2019-11-20 01:44:09,887 INFO L78 Accepts]: Start accepts. Automaton has 9453 states and 10731 transitions. Word has length 244 [2019-11-20 01:44:09,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:44:09,888 INFO L462 AbstractCegarLoop]: Abstraction has 9453 states and 10731 transitions. [2019-11-20 01:44:09,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 01:44:09,888 INFO L276 IsEmpty]: Start isEmpty. Operand 9453 states and 10731 transitions. [2019-11-20 01:44:09,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-11-20 01:44:09,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:44:09,896 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:44:10,107 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:44:10,108 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:44:10,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:44:10,108 INFO L82 PathProgramCache]: Analyzing trace with hash -2134008603, now seen corresponding path program 1 times [2019-11-20 01:44:10,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:44:10,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789508337] [2019-11-20 01:44:10,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:44:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:44:10,330 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:44:10,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789508337] [2019-11-20 01:44:10,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:44:10,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:44:10,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493306521] [2019-11-20 01:44:10,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 01:44:10,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:44:10,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 01:44:10,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:44:10,332 INFO L87 Difference]: Start difference. First operand 9453 states and 10731 transitions. Second operand 5 states. [2019-11-20 01:44:12,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:44:12,024 INFO L93 Difference]: Finished difference Result 27767 states and 31607 transitions. [2019-11-20 01:44:12,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:44:12,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 267 [2019-11-20 01:44:12,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:44:12,042 INFO L225 Difference]: With dead ends: 27767 [2019-11-20 01:44:12,042 INFO L226 Difference]: Without dead ends: 17210 [2019-11-20 01:44:12,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:44:12,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17210 states. [2019-11-20 01:44:12,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17210 to 15168. [2019-11-20 01:44:12,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15168 states. [2019-11-20 01:44:12,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15168 states to 15168 states and 16711 transitions. [2019-11-20 01:44:12,249 INFO L78 Accepts]: Start accepts. Automaton has 15168 states and 16711 transitions. Word has length 267 [2019-11-20 01:44:12,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:44:12,253 INFO L462 AbstractCegarLoop]: Abstraction has 15168 states and 16711 transitions. [2019-11-20 01:44:12,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 01:44:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 15168 states and 16711 transitions. [2019-11-20 01:44:12,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-11-20 01:44:12,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:44:12,261 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2019-11-20 01:44:12,261 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:44:12,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:44:12,261 INFO L82 PathProgramCache]: Analyzing trace with hash 613229861, now seen corresponding path program 1 times [2019-11-20 01:44:12,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:44:12,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442196520] [2019-11-20 01:44:12,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:44:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:44:12,510 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-20 01:44:12,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442196520] [2019-11-20 01:44:12,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:44:12,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:44:12,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998493426] [2019-11-20 01:44:12,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 01:44:12,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:44:12,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 01:44:12,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:44:12,513 INFO L87 Difference]: Start difference. First operand 15168 states and 16711 transitions. Second operand 5 states. [2019-11-20 01:44:13,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:44:13,941 INFO L93 Difference]: Finished difference Result 30334 states and 33414 transitions. [2019-11-20 01:44:13,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:44:13,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 269 [2019-11-20 01:44:13,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:44:13,953 INFO L225 Difference]: With dead ends: 30334 [2019-11-20 01:44:13,953 INFO L226 Difference]: Without dead ends: 15167 [2019-11-20 01:44:13,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:44:13,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15167 states. [2019-11-20 01:44:14,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15167 to 13507. [2019-11-20 01:44:14,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13507 states. [2019-11-20 01:44:14,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13507 states to 13507 states and 14800 transitions. [2019-11-20 01:44:14,138 INFO L78 Accepts]: Start accepts. Automaton has 13507 states and 14800 transitions. Word has length 269 [2019-11-20 01:44:14,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:44:14,139 INFO L462 AbstractCegarLoop]: Abstraction has 13507 states and 14800 transitions. [2019-11-20 01:44:14,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 01:44:14,139 INFO L276 IsEmpty]: Start isEmpty. Operand 13507 states and 14800 transitions. [2019-11-20 01:44:14,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-11-20 01:44:14,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:44:14,148 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:44:14,148 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:44:14,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:44:14,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1472490016, now seen corresponding path program 1 times [2019-11-20 01:44:14,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:44:14,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468601895] [2019-11-20 01:44:14,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:44:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:44:14,788 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 4 proven. 143 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:44:14,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468601895] [2019-11-20 01:44:14,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831588820] [2019-11-20 01:44:14,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d8544ace-93fa-4fe3-8e03-eabefe7d400f/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:44:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:44:14,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 01:44:14,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:44:14,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:44:14,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:44:15,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 01:44:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 92 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:44:15,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:44:15,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2019-11-20 01:44:15,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882248052] [2019-11-20 01:44:15,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 01:44:15,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:44:15,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 01:44:15,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-20 01:44:15,684 INFO L87 Difference]: Start difference. First operand 13507 states and 14800 transitions. Second operand 9 states. [2019-11-20 01:44:22,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:44:22,138 INFO L93 Difference]: Finished difference Result 38620 states and 42189 transitions. [2019-11-20 01:44:22,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 01:44:22,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 289 [2019-11-20 01:44:22,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:44:22,163 INFO L225 Difference]: With dead ends: 38620 [2019-11-20 01:44:22,163 INFO L226 Difference]: Without dead ends: 25299 [2019-11-20 01:44:22,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-11-20 01:44:22,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25299 states. [2019-11-20 01:44:22,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25299 to 15697. [2019-11-20 01:44:22,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15697 states. [2019-11-20 01:44:22,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15697 states to 15697 states and 17149 transitions. [2019-11-20 01:44:22,380 INFO L78 Accepts]: Start accepts. Automaton has 15697 states and 17149 transitions. Word has length 289 [2019-11-20 01:44:22,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:44:22,381 INFO L462 AbstractCegarLoop]: Abstraction has 15697 states and 17149 transitions. [2019-11-20 01:44:22,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 01:44:22,381 INFO L276 IsEmpty]: Start isEmpty. Operand 15697 states and 17149 transitions. [2019-11-20 01:44:22,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-11-20 01:44:22,389 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:44:22,389 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2019-11-20 01:44:22,592 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:44:22,593 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:44:22,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:44:22,593 INFO L82 PathProgramCache]: Analyzing trace with hash 429639918, now seen corresponding path program 1 times [2019-11-20 01:44:22,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:44:22,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805875598] [2019-11-20 01:44:22,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:44:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:44:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-20 01:44:22,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805875598] [2019-11-20 01:44:22,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:44:22,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 01:44:22,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599185046] [2019-11-20 01:44:22,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 01:44:22,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:44:22,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:44:22,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:44:22,966 INFO L87 Difference]: Start difference. First operand 15697 states and 17149 transitions. Second operand 6 states. [2019-11-20 01:44:24,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:44:24,955 INFO L93 Difference]: Finished difference Result 30654 states and 33470 transitions. [2019-11-20 01:44:24,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 01:44:24,956 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 296 [2019-11-20 01:44:24,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:44:24,969 INFO L225 Difference]: With dead ends: 30654 [2019-11-20 01:44:24,969 INFO L226 Difference]: Without dead ends: 15143 [2019-11-20 01:44:24,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:44:24,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15143 states. [2019-11-20 01:44:25,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15143 to 12935. [2019-11-20 01:44:25,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12935 states. [2019-11-20 01:44:25,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12935 states to 12935 states and 13945 transitions. [2019-11-20 01:44:25,168 INFO L78 Accepts]: Start accepts. Automaton has 12935 states and 13945 transitions. Word has length 296 [2019-11-20 01:44:25,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:44:25,168 INFO L462 AbstractCegarLoop]: Abstraction has 12935 states and 13945 transitions. [2019-11-20 01:44:25,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 01:44:25,169 INFO L276 IsEmpty]: Start isEmpty. Operand 12935 states and 13945 transitions. [2019-11-20 01:44:25,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-11-20 01:44:25,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:44:25,182 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2019-11-20 01:44:25,182 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:44:25,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:44:25,183 INFO L82 PathProgramCache]: Analyzing trace with hash 20600226, now seen corresponding path program 1 times [2019-11-20 01:44:25,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:44:25,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601779758] [2019-11-20 01:44:25,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:44:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:44:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 01:44:25,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601779758] [2019-11-20 01:44:25,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:44:25,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:44:25,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672908415] [2019-11-20 01:44:25,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 01:44:25,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:44:25,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 01:44:25,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:44:25,518 INFO L87 Difference]: Start difference. First operand 12935 states and 13945 transitions. Second operand 5 states. [2019-11-20 01:44:27,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:44:27,432 INFO L93 Difference]: Finished difference Result 33795 states and 36619 transitions. [2019-11-20 01:44:27,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:44:27,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 302 [2019-11-20 01:44:27,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:44:27,447 INFO L225 Difference]: With dead ends: 33795 [2019-11-20 01:44:27,447 INFO L226 Difference]: Without dead ends: 21046 [2019-11-20 01:44:27,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:44:27,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21046 states. [2019-11-20 01:44:27,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21046 to 16615. [2019-11-20 01:44:27,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16615 states. [2019-11-20 01:44:27,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16615 states to 16615 states and 17811 transitions. [2019-11-20 01:44:27,652 INFO L78 Accepts]: Start accepts. Automaton has 16615 states and 17811 transitions. Word has length 302 [2019-11-20 01:44:27,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:44:27,653 INFO L462 AbstractCegarLoop]: Abstraction has 16615 states and 17811 transitions. [2019-11-20 01:44:27,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 01:44:27,653 INFO L276 IsEmpty]: Start isEmpty. Operand 16615 states and 17811 transitions. [2019-11-20 01:44:27,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-20 01:44:27,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:44:27,659 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 01:44:27,660 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:44:27,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:44:27,660 INFO L82 PathProgramCache]: Analyzing trace with hash 996873325, now seen corresponding path program 1 times [2019-11-20 01:44:27,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:44:27,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075316484] [2019-11-20 01:44:27,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:44:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:44:27,951 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 251 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:44:27,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075316484] [2019-11-20 01:44:27,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267071154] [2019-11-20 01:44:27,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d8544ace-93fa-4fe3-8e03-eabefe7d400f/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:44:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:44:28,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:44:28,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:44:28,228 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-20 01:44:28,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 01:44:28,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-11-20 01:44:28,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886955270] [2019-11-20 01:44:28,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:44:28,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:44:28,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:44:28,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:44:28,234 INFO L87 Difference]: Start difference. First operand 16615 states and 17811 transitions. Second operand 3 states. [2019-11-20 01:44:29,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:44:29,450 INFO L93 Difference]: Finished difference Result 31578 states and 33910 transitions. [2019-11-20 01:44:29,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:44:29,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-11-20 01:44:29,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:44:29,468 INFO L225 Difference]: With dead ends: 31578 [2019-11-20 01:44:29,469 INFO L226 Difference]: Without dead ends: 16805 [2019-11-20 01:44:29,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:44:29,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16805 states. [2019-11-20 01:44:29,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16805 to 16801. [2019-11-20 01:44:29,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16801 states. [2019-11-20 01:44:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16801 states to 16801 states and 17965 transitions. [2019-11-20 01:44:29,952 INFO L78 Accepts]: Start accepts. Automaton has 16801 states and 17965 transitions. Word has length 307 [2019-11-20 01:44:29,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:44:29,952 INFO L462 AbstractCegarLoop]: Abstraction has 16801 states and 17965 transitions. [2019-11-20 01:44:29,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:44:29,953 INFO L276 IsEmpty]: Start isEmpty. Operand 16801 states and 17965 transitions. [2019-11-20 01:44:29,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-11-20 01:44:29,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:44:29,960 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:44:30,174 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:44:30,174 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:44:30,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:44:30,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1751405250, now seen corresponding path program 1 times [2019-11-20 01:44:30,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:44:30,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413952620] [2019-11-20 01:44:30,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:44:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:44:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-11-20 01:44:30,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413952620] [2019-11-20 01:44:30,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457878676] [2019-11-20 01:44:30,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d8544ace-93fa-4fe3-8e03-eabefe7d400f/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:44:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:44:30,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:44:30,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:44:30,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:44:30,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:44:30,776 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-11-20 01:44:30,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:44:30,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-20 01:44:30,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282272588] [2019-11-20 01:44:30,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:44:30,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:44:30,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:44:30,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:44:30,779 INFO L87 Difference]: Start difference. First operand 16801 states and 17965 transitions. Second operand 4 states. [2019-11-20 01:44:32,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:44:32,146 INFO L93 Difference]: Finished difference Result 20301 states and 21655 transitions. [2019-11-20 01:44:32,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:44:32,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 327 [2019-11-20 01:44:32,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:44:32,162 INFO L225 Difference]: With dead ends: 20301 [2019-11-20 01:44:32,162 INFO L226 Difference]: Without dead ends: 20115 [2019-11-20 01:44:32,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:44:32,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20115 states. [2019-11-20 01:44:32,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20115 to 12567. [2019-11-20 01:44:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12567 states. [2019-11-20 01:44:32,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12567 states to 12567 states and 13451 transitions. [2019-11-20 01:44:32,326 INFO L78 Accepts]: Start accepts. Automaton has 12567 states and 13451 transitions. Word has length 327 [2019-11-20 01:44:32,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:44:32,326 INFO L462 AbstractCegarLoop]: Abstraction has 12567 states and 13451 transitions. [2019-11-20 01:44:32,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:44:32,326 INFO L276 IsEmpty]: Start isEmpty. Operand 12567 states and 13451 transitions. [2019-11-20 01:44:32,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-11-20 01:44:32,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:44:32,334 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-20 01:44:32,537 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:44:32,537 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:44:32,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:44:32,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1491887351, now seen corresponding path program 1 times [2019-11-20 01:44:32,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:44:32,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218820763] [2019-11-20 01:44:32,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:44:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:44:32,838 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-11-20 01:44:32,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218820763] [2019-11-20 01:44:32,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:44:32,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:44:32,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426455319] [2019-11-20 01:44:32,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:44:32,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:44:32,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:44:32,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:44:32,842 INFO L87 Difference]: Start difference. First operand 12567 states and 13451 transitions. Second operand 3 states. [2019-11-20 01:44:33,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:44:33,387 INFO L93 Difference]: Finished difference Result 22910 states and 24453 transitions. [2019-11-20 01:44:33,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:44:33,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2019-11-20 01:44:33,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:44:33,396 INFO L225 Difference]: With dead ends: 22910 [2019-11-20 01:44:33,397 INFO L226 Difference]: Without dead ends: 10528 [2019-11-20 01:44:33,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:44:33,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10528 states. [2019-11-20 01:44:33,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10528 to 10528. [2019-11-20 01:44:33,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10528 states. [2019-11-20 01:44:33,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10528 states to 10528 states and 11183 transitions. [2019-11-20 01:44:33,517 INFO L78 Accepts]: Start accepts. Automaton has 10528 states and 11183 transitions. Word has length 347 [2019-11-20 01:44:33,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:44:33,517 INFO L462 AbstractCegarLoop]: Abstraction has 10528 states and 11183 transitions. [2019-11-20 01:44:33,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:44:33,518 INFO L276 IsEmpty]: Start isEmpty. Operand 10528 states and 11183 transitions. [2019-11-20 01:44:33,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-11-20 01:44:33,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:44:33,526 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:44:33,527 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:44:33,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:44:33,527 INFO L82 PathProgramCache]: Analyzing trace with hash -845426614, now seen corresponding path program 1 times [2019-11-20 01:44:33,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:44:33,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116698920] [2019-11-20 01:44:33,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:44:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:44:33,761 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-20 01:44:33,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116698920] [2019-11-20 01:44:33,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:44:33,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:44:33,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430945051] [2019-11-20 01:44:33,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:44:33,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:44:33,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:44:33,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:44:33,764 INFO L87 Difference]: Start difference. First operand 10528 states and 11183 transitions. Second operand 4 states. [2019-11-20 01:44:35,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:44:35,438 INFO L93 Difference]: Finished difference Result 22901 states and 24340 transitions. [2019-11-20 01:44:35,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:44:35,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 381 [2019-11-20 01:44:35,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:44:35,449 INFO L225 Difference]: With dead ends: 22901 [2019-11-20 01:44:35,449 INFO L226 Difference]: Without dead ends: 12559 [2019-11-20 01:44:35,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:44:35,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12559 states. [2019-11-20 01:44:35,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12559 to 11080. [2019-11-20 01:44:35,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11080 states. [2019-11-20 01:44:35,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11080 states to 11080 states and 11771 transitions. [2019-11-20 01:44:35,583 INFO L78 Accepts]: Start accepts. Automaton has 11080 states and 11771 transitions. Word has length 381 [2019-11-20 01:44:35,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:44:35,584 INFO L462 AbstractCegarLoop]: Abstraction has 11080 states and 11771 transitions. [2019-11-20 01:44:35,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:44:35,584 INFO L276 IsEmpty]: Start isEmpty. Operand 11080 states and 11771 transitions. [2019-11-20 01:44:35,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-11-20 01:44:35,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:44:35,591 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 01:44:35,591 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:44:35,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:44:35,591 INFO L82 PathProgramCache]: Analyzing trace with hash 231889269, now seen corresponding path program 1 times [2019-11-20 01:44:35,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:44:35,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854389028] [2019-11-20 01:44:35,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:44:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:44:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:44:36,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854389028] [2019-11-20 01:44:36,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:44:36,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 01:44:36,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742352628] [2019-11-20 01:44:36,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 01:44:36,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:44:36,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 01:44:36,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:44:36,135 INFO L87 Difference]: Start difference. First operand 11080 states and 11771 transitions. Second operand 7 states. [2019-11-20 01:44:38,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:44:38,653 INFO L93 Difference]: Finished difference Result 24000 states and 25489 transitions. [2019-11-20 01:44:38,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 01:44:38,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 382 [2019-11-20 01:44:38,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:44:38,663 INFO L225 Difference]: With dead ends: 24000 [2019-11-20 01:44:38,663 INFO L226 Difference]: Without dead ends: 12921 [2019-11-20 01:44:38,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:44:38,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12921 states. [2019-11-20 01:44:38,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12921 to 11445. [2019-11-20 01:44:38,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11445 states. [2019-11-20 01:44:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11445 states to 11445 states and 12133 transitions. [2019-11-20 01:44:38,788 INFO L78 Accepts]: Start accepts. Automaton has 11445 states and 12133 transitions. Word has length 382 [2019-11-20 01:44:38,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:44:38,789 INFO L462 AbstractCegarLoop]: Abstraction has 11445 states and 12133 transitions. [2019-11-20 01:44:38,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 01:44:38,789 INFO L276 IsEmpty]: Start isEmpty. Operand 11445 states and 12133 transitions. [2019-11-20 01:44:38,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-11-20 01:44:38,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:44:38,796 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:44:38,796 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:44:38,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:44:38,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1573654033, now seen corresponding path program 1 times [2019-11-20 01:44:38,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:44:38,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698430161] [2019-11-20 01:44:38,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:44:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:44:39,085 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-11-20 01:44:39,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698430161] [2019-11-20 01:44:39,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:44:39,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:44:39,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71014366] [2019-11-20 01:44:39,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:44:39,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:44:39,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:44:39,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:44:39,090 INFO L87 Difference]: Start difference. First operand 11445 states and 12133 transitions. Second operand 4 states. [2019-11-20 01:44:40,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:44:40,478 INFO L93 Difference]: Finished difference Result 24372 states and 25818 transitions. [2019-11-20 01:44:40,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:44:40,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 397 [2019-11-20 01:44:40,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:44:40,491 INFO L225 Difference]: With dead ends: 24372 [2019-11-20 01:44:40,491 INFO L226 Difference]: Without dead ends: 13113 [2019-11-20 01:44:40,497 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:44:40,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13113 states. [2019-11-20 01:44:40,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13113 to 11633. [2019-11-20 01:44:40,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11633 states. [2019-11-20 01:44:40,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11633 states to 11633 states and 12308 transitions. [2019-11-20 01:44:40,633 INFO L78 Accepts]: Start accepts. Automaton has 11633 states and 12308 transitions. Word has length 397 [2019-11-20 01:44:40,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:44:40,635 INFO L462 AbstractCegarLoop]: Abstraction has 11633 states and 12308 transitions. [2019-11-20 01:44:40,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:44:40,635 INFO L276 IsEmpty]: Start isEmpty. Operand 11633 states and 12308 transitions. [2019-11-20 01:44:40,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-11-20 01:44:40,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:44:40,642 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 01:44:40,643 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:44:40,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:44:40,643 INFO L82 PathProgramCache]: Analyzing trace with hash 663206936, now seen corresponding path program 1 times [2019-11-20 01:44:40,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:44:40,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386360939] [2019-11-20 01:44:40,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:44:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:44:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:44:41,065 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:44:41,065 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 01:44:41,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 01:44:41 BoogieIcfgContainer [2019-11-20 01:44:41,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 01:44:41,248 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 01:44:41,248 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 01:44:41,248 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 01:44:41,248 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:43:37" (3/4) ... [2019-11-20 01:44:41,250 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 01:44:41,454 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d8544ace-93fa-4fe3-8e03-eabefe7d400f/bin/uautomizer/witness.graphml [2019-11-20 01:44:41,455 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 01:44:41,456 INFO L168 Benchmark]: Toolchain (without parser) took 67342.16 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 944.8 MB in the beginning and 2.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 234.6 MB. Max. memory is 11.5 GB. [2019-11-20 01:44:41,456 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:44:41,457 INFO L168 Benchmark]: CACSL2BoogieTranslator took 943.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.0 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-11-20 01:44:41,457 INFO L168 Benchmark]: Boogie Procedure Inliner took 144.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-11-20 01:44:41,457 INFO L168 Benchmark]: Boogie Preprocessor took 80.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-11-20 01:44:41,458 INFO L168 Benchmark]: RCFGBuilder took 1892.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 913.4 MB in the end (delta: 184.2 MB). Peak memory consumption was 184.2 MB. Max. memory is 11.5 GB. [2019-11-20 01:44:41,458 INFO L168 Benchmark]: TraceAbstraction took 64069.06 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 913.4 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-20 01:44:41,458 INFO L168 Benchmark]: Witness Printer took 207.24 ms. Allocated memory is still 2.8 GB. Free memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: 84.0 MB). Peak memory consumption was 84.0 MB. Max. memory is 11.5 GB. [2019-11-20 01:44:41,460 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 943.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.0 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 144.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1892.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 913.4 MB in the end (delta: 184.2 MB). Peak memory consumption was 184.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 64069.06 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 913.4 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 207.24 ms. Allocated memory is still 2.8 GB. Free memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: 84.0 MB). Peak memory consumption was 84.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputA = 1; [L8] int inputD = 4; [L9] int inputB = 2; [L10] int inputE = 5; [L11] int inputF = 6; [L12] int inputC = 3; [L15] int a29 = 130; [L16] int a4 = 1; [L17] int a23 = 312; [L18] int a8 = 15; [L19] int a25 = 10; [L20] int a3 = 1; VAL [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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [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)) [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [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)) [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [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)) [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, 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 [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L240] COND TRUE ((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1)) [L241] a29 = ((((a29 / 5) % 15)+ 260) + 1) [L242] a23 = (((((a23 / 5) % 90)- -47) - -159208) - 159206) [L243] a4 = 1 [L244] a25 = 11 [L246] return -1; VAL [a23=111, a25=11, a29=271, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [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)) [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [a23=111, a25=11, a29=271, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L26] COND TRUE ((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)) VAL [a23=111, a25=11, a29=271, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] __VERIFIER_error() VAL [a23=111, a25=11, a29=271, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: UNSAFE, OverallTime: 63.9s, OverallIterations: 22, TraceHistogramMax: 5, AutomataDifference: 48.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3374 SDtfs, 14877 SDslu, 1191 SDs, 0 SdLazy, 33559 SolverSat, 3951 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 37.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1697 GetRequests, 1585 SyntacticMatches, 5 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16801occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 42935 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 7082 NumberOfCodeBlocks, 7082 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 6656 ConstructedInterpolants, 209 QuantifiedInterpolants, 9515620 SizeOfPredicates, 10 NumberOfNonLiveVariables, 2183 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 27 InterpolantComputations, 17 PerfectInterpolantSequences, 3920/4288 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...