./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2c62b450-f75c-49b1-8359-e789dee9a584/bin/ukojak/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_2c62b450-f75c-49b1-8359-e789dee9a584/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2c62b450-f75c-49b1-8359-e789dee9a584/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2c62b450-f75c-49b1-8359-e789dee9a584/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label20.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2c62b450-f75c-49b1-8359-e789dee9a584/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2c62b450-f75c-49b1-8359-e789dee9a584/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c887d58bb2eef8ad59a0d922150e3fdb8c098b0a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.0-69874e2 [2020-12-01 17:19:59,136 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 17:19:59,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 17:19:59,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 17:19:59,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 17:19:59,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 17:19:59,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 17:19:59,256 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 17:19:59,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 17:19:59,262 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 17:19:59,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 17:19:59,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 17:19:59,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 17:19:59,282 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 17:19:59,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 17:19:59,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 17:19:59,287 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 17:19:59,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 17:19:59,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 17:19:59,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 17:19:59,309 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 17:19:59,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 17:19:59,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 17:19:59,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 17:19:59,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 17:19:59,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 17:19:59,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 17:19:59,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 17:19:59,324 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 17:19:59,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 17:19:59,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 17:19:59,328 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 17:19:59,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 17:19:59,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 17:19:59,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 17:19:59,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 17:19:59,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 17:19:59,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 17:19:59,335 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 17:19:59,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 17:19:59,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 17:19:59,339 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2c62b450-f75c-49b1-8359-e789dee9a584/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2020-12-01 17:19:59,372 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 17:19:59,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 17:19:59,375 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-01 17:19:59,376 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2020-12-01 17:19:59,377 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 17:19:59,378 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 17:19:59,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 17:19:59,378 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 17:19:59,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 17:19:59,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 17:19:59,381 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 17:19:59,381 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 17:19:59,381 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 17:19:59,382 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 17:19:59,382 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 17:19:59,382 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 17:19:59,383 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 17:19:59,383 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 17:19:59,383 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2020-12-01 17:19:59,383 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2020-12-01 17:19:59,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 17:19:59,384 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 17:19:59,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-12-01 17:19:59,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 17:19:59,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 17:19:59,385 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 17:19:59,386 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2020-12-01 17:19:59,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 17:19:59,386 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 17:19:59,387 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_2c62b450-f75c-49b1-8359-e789dee9a584/bin/ukojak/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_2c62b450-f75c-49b1-8359-e789dee9a584/bin/ukojak 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(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak 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 -> c887d58bb2eef8ad59a0d922150e3fdb8c098b0a [2020-12-01 17:19:59,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 17:19:59,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 17:19:59,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 17:19:59,831 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 17:19:59,832 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 17:19:59,834 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2c62b450-f75c-49b1-8359-e789dee9a584/bin/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label20.c [2020-12-01 17:19:59,960 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2c62b450-f75c-49b1-8359-e789dee9a584/bin/ukojak/data/ee1098838/673baf03adc746188b3fe861200bfc05/FLAG4ff055c7f [2020-12-01 17:20:00,765 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 17:20:00,766 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2c62b450-f75c-49b1-8359-e789dee9a584/sv-benchmarks/c/eca-rers2012/Problem01_label20.c [2020-12-01 17:20:00,788 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2c62b450-f75c-49b1-8359-e789dee9a584/bin/ukojak/data/ee1098838/673baf03adc746188b3fe861200bfc05/FLAG4ff055c7f [2020-12-01 17:20:00,946 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2c62b450-f75c-49b1-8359-e789dee9a584/bin/ukojak/data/ee1098838/673baf03adc746188b3fe861200bfc05 [2020-12-01 17:20:00,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 17:20:00,953 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 17:20:00,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 17:20:00,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 17:20:00,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 17:20:00,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:20:00" (1/1) ... [2020-12-01 17:20:00,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5274705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:20:00, skipping insertion in model container [2020-12-01 17:20:00,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:20:00" (1/1) ... [2020-12-01 17:20:00,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 17:20:01,059 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 17:20:01,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 17:20:01,632 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 17:20:01,818 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 17:20:01,843 INFO L208 MainTranslator]: Completed translation [2020-12-01 17:20:01,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:20:01 WrapperNode [2020-12-01 17:20:01,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 17:20:01,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 17:20:01,846 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 17:20:01,847 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 17:20:01,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:20:01" (1/1) ... [2020-12-01 17:20:01,896 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:20:01" (1/1) ... [2020-12-01 17:20:01,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 17:20:01,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 17:20:01,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 17:20:01,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 17:20:02,005 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:20:01" (1/1) ... [2020-12-01 17:20:02,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:20:01" (1/1) ... [2020-12-01 17:20:02,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:20:01" (1/1) ... [2020-12-01 17:20:02,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:20:01" (1/1) ... [2020-12-01 17:20:02,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:20:01" (1/1) ... [2020-12-01 17:20:02,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:20:01" (1/1) ... [2020-12-01 17:20:02,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:20:01" (1/1) ... [2020-12-01 17:20:02,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 17:20:02,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 17:20:02,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 17:20:02,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 17:20:02,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:20:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c62b450-f75c-49b1-8359-e789dee9a584/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2020-12-01 17:20:02,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 17:20:02,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 17:20:02,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 17:20:02,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 17:20:05,201 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 17:20:05,202 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-12-01 17:20:05,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:20:05 BoogieIcfgContainer [2020-12-01 17:20:05,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 17:20:05,207 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2020-12-01 17:20:05,208 INFO L271 PluginConnector]: Initializing CodeCheck... [2020-12-01 17:20:05,223 INFO L275 PluginConnector]: CodeCheck initialized [2020-12-01 17:20:05,224 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:20:05" (1/1) ... [2020-12-01 17:20:05,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:20:05,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2020-12-01 17:20:05,321 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2020-12-01 17:20:05,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-12-01 17:20:05,329 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:05,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:20:06,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:06,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 145 states and 261 transitions. [2020-12-01 17:20:06,782 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 261 transitions. [2020-12-01 17:20:06,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-01 17:20:06,792 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:07,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:20:08,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:08,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 215 states and 339 transitions. [2020-12-01 17:20:08,289 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 339 transitions. [2020-12-01 17:20:08,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-01 17:20:08,293 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:20:08,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:08,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 220 states and 347 transitions. [2020-12-01 17:20:08,501 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 347 transitions. [2020-12-01 17:20:08,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-01 17:20:08,509 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:08,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:20:09,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:09,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 290 states and 419 transitions. [2020-12-01 17:20:09,485 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 419 transitions. [2020-12-01 17:20:09,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-01 17:20:09,487 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:09,618 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:20:10,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:10,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 306 states and 439 transitions. [2020-12-01 17:20:10,034 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 439 transitions. [2020-12-01 17:20:10,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-01 17:20:10,049 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:10,183 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-01 17:20:10,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:10,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 316 states and 452 transitions. [2020-12-01 17:20:10,549 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 452 transitions. [2020-12-01 17:20:10,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-01 17:20:10,552 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:10,795 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:20:11,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 343 states and 485 transitions. [2020-12-01 17:20:11,750 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 485 transitions. [2020-12-01 17:20:11,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-01 17:20:11,753 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:11,940 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:20:12,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:12,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 366 states and 511 transitions. [2020-12-01 17:20:12,423 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 511 transitions. [2020-12-01 17:20:12,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-01 17:20:12,428 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:12,541 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-01 17:20:13,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:13,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 377 states and 527 transitions. [2020-12-01 17:20:13,255 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 527 transitions. [2020-12-01 17:20:13,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-01 17:20:13,257 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:13,311 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-01 17:20:13,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:13,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 387 states and 538 transitions. [2020-12-01 17:20:13,542 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 538 transitions. [2020-12-01 17:20:13,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-01 17:20:13,544 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:13,656 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-01 17:20:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:13,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 392 states and 543 transitions. [2020-12-01 17:20:13,918 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 543 transitions. [2020-12-01 17:20:13,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-01 17:20:13,920 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:14,005 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 17:20:14,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 403 states and 558 transitions. [2020-12-01 17:20:14,879 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 558 transitions. [2020-12-01 17:20:14,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-01 17:20:14,881 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 17:20:15,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:15,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 432 states and 590 transitions. [2020-12-01 17:20:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 590 transitions. [2020-12-01 17:20:15,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-01 17:20:15,519 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:15,637 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 17:20:15,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:15,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 437 states and 595 transitions. [2020-12-01 17:20:15,941 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 595 transitions. [2020-12-01 17:20:15,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-01 17:20:15,943 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:16,159 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-01 17:20:16,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:16,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 448 states and 608 transitions. [2020-12-01 17:20:16,767 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 608 transitions. [2020-12-01 17:20:16,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-12-01 17:20:16,770 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:16,899 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:20:17,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:17,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 467 states and 628 transitions. [2020-12-01 17:20:17,524 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 628 transitions. [2020-12-01 17:20:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-01 17:20:17,526 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-12-01 17:20:18,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:18,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 476 states and 641 transitions. [2020-12-01 17:20:18,215 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 641 transitions. [2020-12-01 17:20:18,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-01 17:20:18,218 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:18,271 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-12-01 17:20:18,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:18,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 479 states and 644 transitions. [2020-12-01 17:20:18,423 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 644 transitions. [2020-12-01 17:20:18,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-12-01 17:20:18,426 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:18,559 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-12-01 17:20:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:18,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 483 states and 648 transitions. [2020-12-01 17:20:18,794 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 648 transitions. [2020-12-01 17:20:18,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-01 17:20:18,796 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:18,952 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-01 17:20:19,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:19,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 494 states and 664 transitions. [2020-12-01 17:20:19,903 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 664 transitions. [2020-12-01 17:20:19,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-01 17:20:19,906 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:20,011 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-01 17:20:20,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:20,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 504 states and 675 transitions. [2020-12-01 17:20:20,321 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 675 transitions. [2020-12-01 17:20:20,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-01 17:20:20,324 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:20,393 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-01 17:20:20,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:20,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 509 states and 680 transitions. [2020-12-01 17:20:20,674 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 680 transitions. [2020-12-01 17:20:20,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-12-01 17:20:20,689 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:20,821 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-01 17:20:22,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 550 states and 726 transitions. [2020-12-01 17:20:22,105 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 726 transitions. [2020-12-01 17:20:22,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-01 17:20:22,111 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:22,275 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-01 17:20:23,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:23,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 565 states and 745 transitions. [2020-12-01 17:20:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 745 transitions. [2020-12-01 17:20:23,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-01 17:20:23,270 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-01 17:20:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:23,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 579 states and 760 transitions. [2020-12-01 17:20:23,912 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 760 transitions. [2020-12-01 17:20:23,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-12-01 17:20:23,914 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-12-01 17:20:24,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:24,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 593 states and 774 transitions. [2020-12-01 17:20:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 774 transitions. [2020-12-01 17:20:24,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-12-01 17:20:24,302 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:24,375 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-12-01 17:20:24,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:24,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 607 states and 788 transitions. [2020-12-01 17:20:24,817 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 788 transitions. [2020-12-01 17:20:24,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-12-01 17:20:24,820 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-12-01 17:20:25,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:25,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 621 states and 802 transitions. [2020-12-01 17:20:25,494 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 802 transitions. [2020-12-01 17:20:25,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-01 17:20:25,496 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-01 17:20:26,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:26,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 624 states and 806 transitions. [2020-12-01 17:20:26,073 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 806 transitions. [2020-12-01 17:20:26,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-12-01 17:20:26,076 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:26,180 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-01 17:20:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:26,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 627 states and 810 transitions. [2020-12-01 17:20:26,539 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 810 transitions. [2020-12-01 17:20:26,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-12-01 17:20:26,541 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:26,628 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-01 17:20:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:26,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 630 states and 814 transitions. [2020-12-01 17:20:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 814 transitions. [2020-12-01 17:20:26,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-12-01 17:20:26,943 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-12-01 17:20:28,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:28,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 657 states and 845 transitions. [2020-12-01 17:20:28,324 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 845 transitions. [2020-12-01 17:20:28,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-12-01 17:20:28,327 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:28,447 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-12-01 17:20:29,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:29,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 686 states and 875 transitions. [2020-12-01 17:20:29,361 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 875 transitions. [2020-12-01 17:20:29,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-12-01 17:20:29,364 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-12-01 17:20:29,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:29,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 691 states and 880 transitions. [2020-12-01 17:20:29,724 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 880 transitions. [2020-12-01 17:20:29,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-01 17:20:29,726 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:29,827 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:20:30,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:30,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 723 states and 914 transitions. [2020-12-01 17:20:30,135 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 914 transitions. [2020-12-01 17:20:30,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-01 17:20:30,138 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:30,376 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:20:31,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 793 states and 993 transitions. [2020-12-01 17:20:31,596 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 993 transitions. [2020-12-01 17:20:31,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-01 17:20:31,599 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:31,723 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:20:32,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:32,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 830 states and 1034 transitions. [2020-12-01 17:20:32,145 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1034 transitions. [2020-12-01 17:20:32,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-01 17:20:32,148 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:32,284 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:20:32,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:32,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 867 states and 1072 transitions. [2020-12-01 17:20:32,666 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1072 transitions. [2020-12-01 17:20:32,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-01 17:20:32,670 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:32,740 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-12-01 17:20:33,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:33,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 885 states and 1091 transitions. [2020-12-01 17:20:33,325 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1091 transitions. [2020-12-01 17:20:33,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-12-01 17:20:33,328 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:33,449 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-12-01 17:20:33,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:33,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 886 states and 1091 transitions. [2020-12-01 17:20:33,937 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1091 transitions. [2020-12-01 17:20:33,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-12-01 17:20:33,940 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:34,043 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-01 17:20:34,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:34,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 925 states and 1132 transitions. [2020-12-01 17:20:34,838 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1132 transitions. [2020-12-01 17:20:34,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-01 17:20:34,841 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:35,030 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-01 17:20:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 973 states and 1186 transitions. [2020-12-01 17:20:36,796 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1186 transitions. [2020-12-01 17:20:36,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-01 17:20:36,798 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:36,949 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-01 17:20:38,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:38,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1015 states and 1230 transitions. [2020-12-01 17:20:38,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1230 transitions. [2020-12-01 17:20:38,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-12-01 17:20:38,772 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:39,177 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:20:40,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:40,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1086 states and 1301 transitions. [2020-12-01 17:20:40,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1301 transitions. [2020-12-01 17:20:40,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-12-01 17:20:40,737 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:41,082 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:20:43,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:43,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1151 states and 1389 transitions. [2020-12-01 17:20:43,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1389 transitions. [2020-12-01 17:20:43,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-12-01 17:20:43,266 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:43,380 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:20:45,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:45,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1215 states and 1460 transitions. [2020-12-01 17:20:45,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1460 transitions. [2020-12-01 17:20:45,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-12-01 17:20:45,451 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-01 17:20:46,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:46,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1217 states and 1463 transitions. [2020-12-01 17:20:46,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1463 transitions. [2020-12-01 17:20:46,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-12-01 17:20:46,294 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:46,439 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-01 17:20:46,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:46,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1218 states and 1463 transitions. [2020-12-01 17:20:46,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1463 transitions. [2020-12-01 17:20:46,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-12-01 17:20:46,547 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:46,676 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-01 17:20:47,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:47,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1259 states and 1507 transitions. [2020-12-01 17:20:47,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1507 transitions. [2020-12-01 17:20:47,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-12-01 17:20:47,707 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:47,882 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-01 17:20:48,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1299 states and 1549 transitions. [2020-12-01 17:20:48,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1549 transitions. [2020-12-01 17:20:48,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-12-01 17:20:48,718 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:49,013 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:20:49,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:49,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1338 states and 1591 transitions. [2020-12-01 17:20:49,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1591 transitions. [2020-12-01 17:20:49,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-12-01 17:20:49,731 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:49,857 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:20:50,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:50,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1377 states and 1635 transitions. [2020-12-01 17:20:50,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1635 transitions. [2020-12-01 17:20:50,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-12-01 17:20:50,677 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:50,856 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-12-01 17:20:51,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:51,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1380 states and 1638 transitions. [2020-12-01 17:20:51,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1638 transitions. [2020-12-01 17:20:51,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-12-01 17:20:51,164 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-12-01 17:20:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:51,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1383 states and 1641 transitions. [2020-12-01 17:20:51,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1641 transitions. [2020-12-01 17:20:51,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-12-01 17:20:51,594 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-12-01 17:20:52,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:52,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1408 states and 1667 transitions. [2020-12-01 17:20:52,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1667 transitions. [2020-12-01 17:20:52,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-12-01 17:20:52,323 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:52,417 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-12-01 17:20:52,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:52,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1432 states and 1691 transitions. [2020-12-01 17:20:52,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1691 transitions. [2020-12-01 17:20:52,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-12-01 17:20:52,657 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:20:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:20:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1547 states and 1823 transitions. [2020-12-01 17:20:57,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 1823 transitions. [2020-12-01 17:20:57,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-12-01 17:20:57,827 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:20:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:20:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:21:01,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:21:01,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1660 states and 1947 transitions. [2020-12-01 17:21:01,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 1947 transitions. [2020-12-01 17:21:01,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-12-01 17:21:01,639 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:21:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:21:02,271 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-12-01 17:21:05,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:21:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1704 states and 1999 transitions. [2020-12-01 17:21:05,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 1999 transitions. [2020-12-01 17:21:05,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-12-01 17:21:05,155 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:21:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:21:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-12-01 17:21:07,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:21:07,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 1750 states and 2052 transitions. [2020-12-01 17:21:07,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2052 transitions. [2020-12-01 17:21:07,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-12-01 17:21:07,676 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:21:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:21:07,975 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2020-12-01 17:21:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:21:09,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 1769 states and 2070 transitions. [2020-12-01 17:21:09,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2070 transitions. [2020-12-01 17:21:09,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-12-01 17:21:09,228 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:21:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:21:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2020-12-01 17:21:10,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:21:10,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 1788 states and 2088 transitions. [2020-12-01 17:21:10,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2088 transitions. [2020-12-01 17:21:10,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2020-12-01 17:21:10,311 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:21:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:21:10,686 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2020-12-01 17:21:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:21:11,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 1858 states and 2160 transitions. [2020-12-01 17:21:11,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2160 transitions. [2020-12-01 17:21:11,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-12-01 17:21:11,612 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:21:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:21:11,783 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-12-01 17:21:11,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:21:11,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2162 states to 1860 states and 2162 transitions. [2020-12-01 17:21:11,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 2162 transitions. [2020-12-01 17:21:11,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-12-01 17:21:11,960 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:21:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:21:12,130 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-12-01 17:21:12,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:21:12,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2162 states to 1861 states and 2162 transitions. [2020-12-01 17:21:12,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1861 states and 2162 transitions. [2020-12-01 17:21:12,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-12-01 17:21:12,380 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:21:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:21:12,622 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-12-01 17:21:13,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:21:13,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 1862 states and 2164 transitions. [2020-12-01 17:21:13,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2164 transitions. [2020-12-01 17:21:13,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-12-01 17:21:13,321 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:21:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:21:13,772 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-01 17:21:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:21:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 1932 states and 2236 transitions. [2020-12-01 17:21:14,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2236 transitions. [2020-12-01 17:21:14,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-12-01 17:21:14,735 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:21:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:21:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2020-12-01 17:21:15,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:21:15,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 1953 states and 2261 transitions. [2020-12-01 17:21:15,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 2261 transitions. [2020-12-01 17:21:15,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-12-01 17:21:15,530 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:21:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:21:15,663 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2020-12-01 17:21:15,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:21:15,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 1962 states and 2271 transitions. [2020-12-01 17:21:15,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2271 transitions. [2020-12-01 17:21:15,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2020-12-01 17:21:15,926 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:21:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:21:17,242 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 296 proven. 174 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-01 17:21:22,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:21:22,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2032 states and 2352 transitions. [2020-12-01 17:21:22,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 2352 transitions. [2020-12-01 17:21:22,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2020-12-01 17:21:22,126 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:21:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:21:22,561 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 296 proven. 174 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-01 17:21:24,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:21:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2069 states and 2390 transitions. [2020-12-01 17:21:24,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 2390 transitions. [2020-12-01 17:21:24,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2020-12-01 17:21:24,341 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:21:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:21:24,817 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 202 proven. 114 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2020-12-01 17:21:33,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:21:33,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2246 states and 2584 transitions. [2020-12-01 17:21:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 2584 transitions. [2020-12-01 17:21:33,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2020-12-01 17:21:33,067 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:21:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:21:33,922 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 361 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-12-01 17:21:37,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:21:37,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2285 states and 2624 transitions. [2020-12-01 17:21:37,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 2624 transitions. [2020-12-01 17:21:37,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2020-12-01 17:21:37,235 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:21:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:21:37,492 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 361 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-12-01 17:21:40,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:21:40,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2324 states and 2664 transitions. [2020-12-01 17:21:40,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 2664 transitions. [2020-12-01 17:21:40,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2020-12-01 17:21:40,015 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:21:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:21:40,242 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2020-12-01 17:21:41,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:21:41,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2340 states and 2683 transitions. [2020-12-01 17:21:41,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 2683 transitions. [2020-12-01 17:21:41,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2020-12-01 17:21:41,706 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:21:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:21:41,891 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2020-12-01 17:21:42,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:21:42,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2344 states and 2686 transitions. [2020-12-01 17:21:42,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 2686 transitions. [2020-12-01 17:21:42,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2020-12-01 17:21:42,382 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:21:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:21:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2020-12-01 17:21:43,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:21:43,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2725 states to 2382 states and 2725 transitions. [2020-12-01 17:21:43,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 2725 transitions. [2020-12-01 17:21:43,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2020-12-01 17:21:43,362 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:21:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:21:43,444 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:21:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:21:43,558 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:21:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:21:43,877 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:21:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:21:43,983 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:21:52,526 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 78 iterations. [2020-12-01 17:21:52,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 05:21:52 ImpRootNode [2020-12-01 17:21:52,851 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2020-12-01 17:21:52,852 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 17:21:52,852 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 17:21:52,852 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 17:21:52,853 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:20:05" (3/4) ... [2020-12-01 17:21:52,856 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 17:21:53,229 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2c62b450-f75c-49b1-8359-e789dee9a584/bin/ukojak/witness.graphml [2020-12-01 17:21:53,229 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 17:21:53,231 INFO L168 Benchmark]: Toolchain (without parser) took 112277.31 ms. Allocated memory was 90.2 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 53.1 MB in the beginning and 921.6 MB in the end (delta: -868.5 MB). Peak memory consumption was 450.2 MB. Max. memory is 16.1 GB. [2020-12-01 17:21:53,232 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 90.2 MB. Free memory is still 71.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 17:21:53,233 INFO L168 Benchmark]: CACSL2BoogieTranslator took 885.96 ms. Allocated memory is still 90.2 MB. Free memory was 52.9 MB in the beginning and 50.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-01 17:21:53,233 INFO L168 Benchmark]: Boogie Procedure Inliner took 143.10 ms. Allocated memory is still 90.2 MB. Free memory was 50.6 MB in the beginning and 44.9 MB in the end (delta: 5.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-01 17:21:53,234 INFO L168 Benchmark]: Boogie Preprocessor took 131.07 ms. Allocated memory is still 90.2 MB. Free memory was 44.9 MB in the beginning and 40.4 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-01 17:21:53,234 INFO L168 Benchmark]: RCFGBuilder took 3083.74 ms. Allocated memory was 90.2 MB in the beginning and 144.7 MB in the end (delta: 54.5 MB). Free memory was 40.4 MB in the beginning and 86.4 MB in the end (delta: -45.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 16.1 GB. [2020-12-01 17:21:53,235 INFO L168 Benchmark]: CodeCheck took 107643.82 ms. Allocated memory was 144.7 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 86.4 MB in the beginning and 966.7 MB in the end (delta: -880.3 MB). Peak memory consumption was 382.2 MB. Max. memory is 16.1 GB. [2020-12-01 17:21:53,235 INFO L168 Benchmark]: Witness Printer took 377.50 ms. Allocated memory is still 1.4 GB. Free memory was 966.7 MB in the beginning and 921.6 MB in the end (delta: 45.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. [2020-12-01 17:21:53,239 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 107.2s, OverallIterations: 78, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12655616 SDtfs, 1645916928 SDslu, 85917568 SDs, 0 SdLazy, 106597566 SolverSat, -67368102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 521.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84007 GetRequests, 80797 SyntacticMatches, 2596 SemanticMatches, 614 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296166 ImplicationChecksByTransitivity, 65.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.7s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 12491 NumberOfCodeBlocks, 12491 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 12131 ConstructedInterpolants, 0 QuantifiedInterpolants, 7807959 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 77 InterpolantComputations, 69 PerfectInterpolantSequences, 11071/11754 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND TRUE ((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5)) [L272] a16 = 4 [L273] a20 = 0 [L274] return 25; VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND TRUE ((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1))))))))) [L249] a20 = 0 [L250] a21 = 1 [L251] a17 = 0 [L252] a8 = 14 [L253] a16 = 4 [L254] return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L401] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L12] __assert_fail("0", "Problem01_label20.c", 4, "reach_error") VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45 ms. Allocated memory is still 90.2 MB. Free memory is still 71.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 885.96 ms. Allocated memory is still 90.2 MB. Free memory was 52.9 MB in the beginning and 50.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 143.10 ms. Allocated memory is still 90.2 MB. Free memory was 50.6 MB in the beginning and 44.9 MB in the end (delta: 5.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 131.07 ms. Allocated memory is still 90.2 MB. Free memory was 44.9 MB in the beginning and 40.4 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3083.74 ms. Allocated memory was 90.2 MB in the beginning and 144.7 MB in the end (delta: 54.5 MB). Free memory was 40.4 MB in the beginning and 86.4 MB in the end (delta: -45.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 16.1 GB. * CodeCheck took 107643.82 ms. Allocated memory was 144.7 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 86.4 MB in the beginning and 966.7 MB in the end (delta: -880.3 MB). Peak memory consumption was 382.2 MB. Max. memory is 16.1 GB. * Witness Printer took 377.50 ms. Allocated memory is still 1.4 GB. Free memory was 966.7 MB in the beginning and 921.6 MB in the end (delta: 45.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...