./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label35.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_e26c40c6-035f-4111-90fd-bde8910809df/bin/ukojak/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_e26c40c6-035f-4111-90fd-bde8910809df/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e26c40c6-035f-4111-90fd-bde8910809df/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e26c40c6-035f-4111-90fd-bde8910809df/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label35.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e26c40c6-035f-4111-90fd-bde8910809df/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e26c40c6-035f-4111-90fd-bde8910809df/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 aa99ae6afdd898d7c44aa284b00c7f7e112a2986 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:53:12,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 17:53:12,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 17:53:12,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 17:53:12,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 17:53:12,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 17:53:12,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 17:53:12,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 17:53:12,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 17:53:12,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 17:53:12,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 17:53:12,131 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 17:53:12,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 17:53:12,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 17:53:12,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 17:53:12,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 17:53:12,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 17:53:12,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 17:53:12,141 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 17:53:12,143 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 17:53:12,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 17:53:12,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 17:53:12,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 17:53:12,149 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 17:53:12,153 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 17:53:12,153 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 17:53:12,154 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 17:53:12,155 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 17:53:12,155 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 17:53:12,156 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 17:53:12,157 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 17:53:12,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 17:53:12,159 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 17:53:12,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 17:53:12,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 17:53:12,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 17:53:12,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 17:53:12,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 17:53:12,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 17:53:12,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 17:53:12,165 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 17:53:12,166 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e26c40c6-035f-4111-90fd-bde8910809df/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2020-12-01 17:53:12,188 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 17:53:12,189 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 17:53:12,190 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-01 17:53:12,190 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2020-12-01 17:53:12,191 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 17:53:12,191 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 17:53:12,192 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 17:53:12,192 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 17:53:12,192 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 17:53:12,193 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 17:53:12,193 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 17:53:12,193 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 17:53:12,194 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 17:53:12,194 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 17:53:12,195 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 17:53:12,195 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 17:53:12,195 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 17:53:12,196 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 17:53:12,196 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2020-12-01 17:53:12,196 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2020-12-01 17:53:12,197 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 17:53:12,197 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 17:53:12,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-12-01 17:53:12,198 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 17:53:12,198 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 17:53:12,199 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 17:53:12,199 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2020-12-01 17:53:12,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 17:53:12,199 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 17:53:12,199 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_e26c40c6-035f-4111-90fd-bde8910809df/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_e26c40c6-035f-4111-90fd-bde8910809df/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 -> aa99ae6afdd898d7c44aa284b00c7f7e112a2986 [2020-12-01 17:53:12,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 17:53:12,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 17:53:12,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 17:53:12,477 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 17:53:12,479 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 17:53:12,480 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e26c40c6-035f-4111-90fd-bde8910809df/bin/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label35.c [2020-12-01 17:53:12,583 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e26c40c6-035f-4111-90fd-bde8910809df/bin/ukojak/data/1d7c18987/c9b0c11eb1324bad99183b714b5077e2/FLAG1da29a601 [2020-12-01 17:53:13,125 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 17:53:13,125 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e26c40c6-035f-4111-90fd-bde8910809df/sv-benchmarks/c/eca-rers2012/Problem01_label35.c [2020-12-01 17:53:13,137 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e26c40c6-035f-4111-90fd-bde8910809df/bin/ukojak/data/1d7c18987/c9b0c11eb1324bad99183b714b5077e2/FLAG1da29a601 [2020-12-01 17:53:13,390 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e26c40c6-035f-4111-90fd-bde8910809df/bin/ukojak/data/1d7c18987/c9b0c11eb1324bad99183b714b5077e2 [2020-12-01 17:53:13,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 17:53:13,394 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 17:53:13,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 17:53:13,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 17:53:13,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 17:53:13,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:53:13" (1/1) ... [2020-12-01 17:53:13,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f9607e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:53:13, skipping insertion in model container [2020-12-01 17:53:13,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:53:13" (1/1) ... [2020-12-01 17:53:13,412 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 17:53:13,454 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 17:53:13,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 17:53:13,872 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 17:53:14,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 17:53:14,046 INFO L208 MainTranslator]: Completed translation [2020-12-01 17:53:14,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:53:14 WrapperNode [2020-12-01 17:53:14,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 17:53:14,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 17:53:14,049 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 17:53:14,049 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 17:53:14,059 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:53:14" (1/1) ... [2020-12-01 17:53:14,090 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:53:14" (1/1) ... [2020-12-01 17:53:14,155 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 17:53:14,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 17:53:14,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 17:53:14,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 17:53:14,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:53:14" (1/1) ... [2020-12-01 17:53:14,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:53:14" (1/1) ... [2020-12-01 17:53:14,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:53:14" (1/1) ... [2020-12-01 17:53:14,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:53:14" (1/1) ... [2020-12-01 17:53:14,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:53:14" (1/1) ... [2020-12-01 17:53:14,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:53:14" (1/1) ... [2020-12-01 17:53:14,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:53:14" (1/1) ... [2020-12-01 17:53:14,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 17:53:14,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 17:53:14,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 17:53:14,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 17:53:14,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:53:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e26c40c6-035f-4111-90fd-bde8910809df/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:53:14,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 17:53:14,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 17:53:14,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 17:53:14,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 17:53:16,819 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 17:53:16,819 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-12-01 17:53:16,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:53:16 BoogieIcfgContainer [2020-12-01 17:53:16,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 17:53:16,824 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2020-12-01 17:53:16,825 INFO L271 PluginConnector]: Initializing CodeCheck... [2020-12-01 17:53:16,838 INFO L275 PluginConnector]: CodeCheck initialized [2020-12-01 17:53:16,838 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:53:16" (1/1) ... [2020-12-01 17:53:16,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 17:53:16,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:16,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2020-12-01 17:53:16,919 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2020-12-01 17:53:16,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-12-01 17:53:16,925 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:17,504 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:53:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2020-12-01 17:53:18,350 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2020-12-01 17:53:18,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-01 17:53:18,359 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:18,563 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:53:18,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:18,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2020-12-01 17:53:18,977 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2020-12-01 17:53:18,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-01 17:53:18,986 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:19,103 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:53:19,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:19,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 151 states and 247 transitions. [2020-12-01 17:53:19,189 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 247 transitions. [2020-12-01 17:53:19,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-01 17:53:19,192 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:19,371 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:53:20,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:20,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 221 states and 319 transitions. [2020-12-01 17:53:20,151 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 319 transitions. [2020-12-01 17:53:20,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-01 17:53:20,152 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:20,263 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:53:20,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:20,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 228 states and 329 transitions. [2020-12-01 17:53:20,528 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 329 transitions. [2020-12-01 17:53:20,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-01 17:53:20,536 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:53:21,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:21,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 239 states and 348 transitions. [2020-12-01 17:53:21,346 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 348 transitions. [2020-12-01 17:53:21,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-01 17:53:21,353 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:21,422 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:53:21,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 244 states and 353 transitions. [2020-12-01 17:53:21,601 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 353 transitions. [2020-12-01 17:53:21,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-01 17:53:21,602 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:21,654 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:53:21,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:21,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 249 states and 358 transitions. [2020-12-01 17:53:21,712 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 358 transitions. [2020-12-01 17:53:21,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-01 17:53:21,714 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:21,891 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:53:22,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:22,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 257 states and 368 transitions. [2020-12-01 17:53:22,222 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 368 transitions. [2020-12-01 17:53:22,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-01 17:53:22,224 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:22,326 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 17:53:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:23,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 270 states and 386 transitions. [2020-12-01 17:53:23,195 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 386 transitions. [2020-12-01 17:53:23,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-01 17:53:23,197 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:23,257 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 17:53:23,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:23,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 275 states and 391 transitions. [2020-12-01 17:53:23,513 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 391 transitions. [2020-12-01 17:53:23,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-12-01 17:53:23,514 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:23,565 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:53:23,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:23,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 280 states and 396 transitions. [2020-12-01 17:53:23,621 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 396 transitions. [2020-12-01 17:53:23,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-01 17:53:23,623 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:23,659 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:53:24,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 284 states and 401 transitions. [2020-12-01 17:53:24,155 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 401 transitions. [2020-12-01 17:53:24,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-12-01 17:53:24,157 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:24,245 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:53:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 297 states and 423 transitions. [2020-12-01 17:53:25,145 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 423 transitions. [2020-12-01 17:53:25,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-12-01 17:53:25,147 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:25,190 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:53:25,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 315 states and 444 transitions. [2020-12-01 17:53:25,935 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 444 transitions. [2020-12-01 17:53:25,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-01 17:53:25,937 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:25,973 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:53:26,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 317 states and 446 transitions. [2020-12-01 17:53:26,093 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 446 transitions. [2020-12-01 17:53:26,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-01 17:53:26,095 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:26,130 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:53:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:26,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 323 states and 456 transitions. [2020-12-01 17:53:26,506 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 456 transitions. [2020-12-01 17:53:26,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-01 17:53:26,507 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:26,581 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 17:53:27,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:27,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 333 states and 468 transitions. [2020-12-01 17:53:27,061 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 468 transitions. [2020-12-01 17:53:27,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-01 17:53:27,062 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:27,103 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:53:27,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:27,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 345 states and 480 transitions. [2020-12-01 17:53:27,586 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 480 transitions. [2020-12-01 17:53:27,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-01 17:53:27,588 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:27,630 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:53:27,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:27,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 347 states and 482 transitions. [2020-12-01 17:53:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 482 transitions. [2020-12-01 17:53:27,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-01 17:53:27,751 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:27,786 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-01 17:53:27,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:27,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 348 states and 483 transitions. [2020-12-01 17:53:27,808 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 483 transitions. [2020-12-01 17:53:27,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-01 17:53:27,809 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:27,912 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:53:28,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:28,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 364 states and 503 transitions. [2020-12-01 17:53:28,650 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 503 transitions. [2020-12-01 17:53:28,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-12-01 17:53:28,651 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:28,699 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:53:28,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:28,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 371 states and 510 transitions. [2020-12-01 17:53:28,914 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 510 transitions. [2020-12-01 17:53:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-12-01 17:53:28,915 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:28,948 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:53:29,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:29,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 383 states and 524 transitions. [2020-12-01 17:53:29,283 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 524 transitions. [2020-12-01 17:53:29,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-01 17:53:29,285 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:29,433 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:53:29,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:29,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 402 states and 546 transitions. [2020-12-01 17:53:29,994 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 546 transitions. [2020-12-01 17:53:29,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-01 17:53:29,996 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:53:30,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:30,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 408 states and 552 transitions. [2020-12-01 17:53:30,160 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 552 transitions. [2020-12-01 17:53:30,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-12-01 17:53:30,162 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-01 17:53:30,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:30,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 411 states and 555 transitions. [2020-12-01 17:53:30,492 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 555 transitions. [2020-12-01 17:53:30,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-12-01 17:53:30,494 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:30,559 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:53:30,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:30,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 417 states and 561 transitions. [2020-12-01 17:53:30,833 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 561 transitions. [2020-12-01 17:53:30,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-12-01 17:53:30,835 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:30,905 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:53:31,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:31,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 440 states and 589 transitions. [2020-12-01 17:53:31,253 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 589 transitions. [2020-12-01 17:53:31,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-01 17:53:31,254 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:31,384 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:53:32,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:32,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 479 states and 635 transitions. [2020-12-01 17:53:32,757 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 635 transitions. [2020-12-01 17:53:32,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-12-01 17:53:32,766 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:32,821 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:53:32,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 487 states and 643 transitions. [2020-12-01 17:53:32,894 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 643 transitions. [2020-12-01 17:53:32,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-12-01 17:53:32,896 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:32,947 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:53:33,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 510 states and 669 transitions. [2020-12-01 17:53:33,304 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 669 transitions. [2020-12-01 17:53:33,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-12-01 17:53:33,306 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:33,353 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:53:33,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:33,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 529 states and 688 transitions. [2020-12-01 17:53:33,645 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 688 transitions. [2020-12-01 17:53:33,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-12-01 17:53:33,647 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:33,712 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-01 17:53:34,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:34,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 557 states and 719 transitions. [2020-12-01 17:53:34,353 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 719 transitions. [2020-12-01 17:53:34,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-01 17:53:34,355 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:34,406 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 17:53:35,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:35,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 592 states and 762 transitions. [2020-12-01 17:53:35,764 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 762 transitions. [2020-12-01 17:53:35,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-01 17:53:35,765 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:35,809 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 17:53:36,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:36,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 611 states and 784 transitions. [2020-12-01 17:53:36,923 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 784 transitions. [2020-12-01 17:53:36,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-01 17:53:36,925 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:36,972 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 17:53:37,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:37,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 630 states and 803 transitions. [2020-12-01 17:53:37,403 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 803 transitions. [2020-12-01 17:53:37,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-01 17:53:37,405 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:37,544 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:53:37,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:37,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 646 states and 820 transitions. [2020-12-01 17:53:37,951 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 820 transitions. [2020-12-01 17:53:37,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-01 17:53:37,953 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:38,103 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:53:39,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:39,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 656 states and 836 transitions. [2020-12-01 17:53:39,403 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 836 transitions. [2020-12-01 17:53:39,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-01 17:53:39,407 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:39,495 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:53:39,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:39,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 661 states and 842 transitions. [2020-12-01 17:53:39,780 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 842 transitions. [2020-12-01 17:53:39,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-01 17:53:39,782 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:39,906 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:53:40,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:40,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 673 states and 856 transitions. [2020-12-01 17:53:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 856 transitions. [2020-12-01 17:53:40,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-01 17:53:40,467 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:40,576 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:53:41,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:41,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 697 states and 884 transitions. [2020-12-01 17:53:41,528 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 884 transitions. [2020-12-01 17:53:41,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-12-01 17:53:41,530 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-01 17:53:41,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:41,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 698 states and 886 transitions. [2020-12-01 17:53:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 886 transitions. [2020-12-01 17:53:41,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-12-01 17:53:41,801 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:41,862 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-01 17:53:42,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:42,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 703 states and 891 transitions. [2020-12-01 17:53:42,154 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 891 transitions. [2020-12-01 17:53:42,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-12-01 17:53:42,156 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:42,210 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:53:42,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:42,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 717 states and 908 transitions. [2020-12-01 17:53:42,793 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 908 transitions. [2020-12-01 17:53:42,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-12-01 17:53:42,795 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:42,853 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:53:43,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:43,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 721 states and 912 transitions. [2020-12-01 17:53:43,385 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 912 transitions. [2020-12-01 17:53:43,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-12-01 17:53:43,387 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:43,432 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:53:43,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 726 states and 919 transitions. [2020-12-01 17:53:43,745 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 919 transitions. [2020-12-01 17:53:43,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-12-01 17:53:43,747 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:53:44,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:44,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 745 states and 939 transitions. [2020-12-01 17:53:44,090 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 939 transitions. [2020-12-01 17:53:44,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-12-01 17:53:44,092 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:44,249 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:53:46,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:46,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 785 states and 991 transitions. [2020-12-01 17:53:46,539 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 991 transitions. [2020-12-01 17:53:46,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-12-01 17:53:46,541 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:46,609 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:53:48,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:48,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 819 states and 1027 transitions. [2020-12-01 17:53:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1027 transitions. [2020-12-01 17:53:48,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-12-01 17:53:48,171 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:48,280 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 17:53:48,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:48,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 824 states and 1033 transitions. [2020-12-01 17:53:48,580 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1033 transitions. [2020-12-01 17:53:48,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-12-01 17:53:48,581 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-01 17:53:49,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:49,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 833 states and 1045 transitions. [2020-12-01 17:53:49,115 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1045 transitions. [2020-12-01 17:53:49,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-12-01 17:53:49,117 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-01 17:53:49,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:49,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 834 states and 1046 transitions. [2020-12-01 17:53:49,518 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1046 transitions. [2020-12-01 17:53:49,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-12-01 17:53:49,519 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:49,567 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:53:50,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:50,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 846 states and 1058 transitions. [2020-12-01 17:53:50,323 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1058 transitions. [2020-12-01 17:53:50,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-12-01 17:53:50,324 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:50,398 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2020-12-01 17:53:51,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 935 states and 1153 transitions. [2020-12-01 17:53:51,738 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1153 transitions. [2020-12-01 17:53:51,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-12-01 17:53:51,740 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:52,054 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 68 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:53:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:54,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 963 states and 1202 transitions. [2020-12-01 17:53:54,957 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1202 transitions. [2020-12-01 17:53:54,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-12-01 17:53:54,959 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:55,016 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-01 17:53:55,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 969 states and 1210 transitions. [2020-12-01 17:53:55,499 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1210 transitions. [2020-12-01 17:53:55,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-12-01 17:53:55,501 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-01 17:53:55,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:55,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 970 states and 1210 transitions. [2020-12-01 17:53:55,781 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1210 transitions. [2020-12-01 17:53:55,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-01 17:53:55,783 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:55,914 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:53:56,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:53:56,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 992 states and 1244 transitions. [2020-12-01 17:53:56,628 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1244 transitions. [2020-12-01 17:53:56,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-01 17:53:56,630 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:53:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:53:56,945 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:54:00,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1132 states and 1394 transitions. [2020-12-01 17:54:00,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1394 transitions. [2020-12-01 17:54:00,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-12-01 17:54:00,700 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-12-01 17:54:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:01,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1145 states and 1408 transitions. [2020-12-01 17:54:01,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1408 transitions. [2020-12-01 17:54:01,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-12-01 17:54:01,389 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:01,447 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-12-01 17:54:01,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:01,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1153 states and 1417 transitions. [2020-12-01 17:54:01,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1417 transitions. [2020-12-01 17:54:01,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-01 17:54:01,811 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:54:02,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:02,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1165 states and 1435 transitions. [2020-12-01 17:54:02,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1435 transitions. [2020-12-01 17:54:02,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-01 17:54:02,601 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:02,671 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:54:02,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:02,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1175 states and 1446 transitions. [2020-12-01 17:54:02,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1446 transitions. [2020-12-01 17:54:02,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-01 17:54:02,892 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:54:03,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:03,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1180 states and 1452 transitions. [2020-12-01 17:54:03,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1452 transitions. [2020-12-01 17:54:03,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-01 17:54:03,291 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:54:03,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:03,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1190 states and 1461 transitions. [2020-12-01 17:54:03,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1461 transitions. [2020-12-01 17:54:03,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-01 17:54:03,755 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:03,810 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:54:04,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:04,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1204 states and 1477 transitions. [2020-12-01 17:54:04,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1477 transitions. [2020-12-01 17:54:04,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-12-01 17:54:04,806 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:04,885 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:54:05,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:05,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1205 states and 1477 transitions. [2020-12-01 17:54:05,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1477 transitions. [2020-12-01 17:54:05,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-12-01 17:54:05,038 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2020-12-01 17:54:05,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:05,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1213 states and 1486 transitions. [2020-12-01 17:54:05,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1486 transitions. [2020-12-01 17:54:05,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-12-01 17:54:05,735 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:05,800 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:54:05,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1234 states and 1508 transitions. [2020-12-01 17:54:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1508 transitions. [2020-12-01 17:54:05,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-12-01 17:54:05,954 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:06,012 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:54:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:06,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1241 states and 1515 transitions. [2020-12-01 17:54:06,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1515 transitions. [2020-12-01 17:54:06,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-01 17:54:06,207 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:06,525 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 93 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:54:09,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:09,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1288 states and 1571 transitions. [2020-12-01 17:54:09,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1571 transitions. [2020-12-01 17:54:09,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-01 17:54:09,764 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:09,837 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 93 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:54:10,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:10,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1292 states and 1576 transitions. [2020-12-01 17:54:10,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1576 transitions. [2020-12-01 17:54:10,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-01 17:54:10,648 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:10,722 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-01 17:54:12,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1327 states and 1617 transitions. [2020-12-01 17:54:12,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1617 transitions. [2020-12-01 17:54:12,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-01 17:54:12,658 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:12,742 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-01 17:54:13,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:13,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1332 states and 1623 transitions. [2020-12-01 17:54:13,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1623 transitions. [2020-12-01 17:54:13,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-01 17:54:13,620 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:13,693 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-01 17:54:14,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:14,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1340 states and 1631 transitions. [2020-12-01 17:54:14,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1631 transitions. [2020-12-01 17:54:14,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-01 17:54:14,167 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:14,221 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-12-01 17:54:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:14,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1342 states and 1632 transitions. [2020-12-01 17:54:14,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1632 transitions. [2020-12-01 17:54:14,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-12-01 17:54:14,685 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:15,102 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:54:16,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1413 states and 1703 transitions. [2020-12-01 17:54:16,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1703 transitions. [2020-12-01 17:54:16,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-12-01 17:54:16,927 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:17,008 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:54:18,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:18,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1435 states and 1727 transitions. [2020-12-01 17:54:18,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1727 transitions. [2020-12-01 17:54:18,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-12-01 17:54:18,964 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:54:19,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1447 states and 1740 transitions. [2020-12-01 17:54:19,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1740 transitions. [2020-12-01 17:54:19,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-12-01 17:54:19,753 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:19,845 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:54:20,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:20,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1452 states and 1745 transitions. [2020-12-01 17:54:20,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1745 transitions. [2020-12-01 17:54:20,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-12-01 17:54:20,559 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:20,645 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:54:21,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:21,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1457 states and 1750 transitions. [2020-12-01 17:54:21,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1750 transitions. [2020-12-01 17:54:21,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-12-01 17:54:21,106 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 101 proven. 27 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:54:28,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:28,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1530 states and 1841 transitions. [2020-12-01 17:54:28,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 1841 transitions. [2020-12-01 17:54:28,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-12-01 17:54:28,754 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:28,917 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 101 proven. 27 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:54:30,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:30,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1538 states and 1848 transitions. [2020-12-01 17:54:30,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 1848 transitions. [2020-12-01 17:54:30,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-01 17:54:30,528 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 102 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:54:31,432 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2020-12-01 17:54:33,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1553 states and 1872 transitions. [2020-12-01 17:54:33,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 1872 transitions. [2020-12-01 17:54:33,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-01 17:54:33,016 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:33,115 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 102 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:54:34,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:34,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1559 states and 1878 transitions. [2020-12-01 17:54:34,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 1878 transitions. [2020-12-01 17:54:34,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-01 17:54:34,374 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:34,462 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:54:36,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1578 states and 1899 transitions. [2020-12-01 17:54:36,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 1899 transitions. [2020-12-01 17:54:36,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-01 17:54:36,338 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:36,407 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:54:36,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:36,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1580 states and 1900 transitions. [2020-12-01 17:54:36,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 1900 transitions. [2020-12-01 17:54:36,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-12-01 17:54:36,882 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:37,135 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 101 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 17:54:39,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:39,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1588 states and 1912 transitions. [2020-12-01 17:54:39,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 1912 transitions. [2020-12-01 17:54:39,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-12-01 17:54:39,661 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:39,757 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 101 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 17:54:40,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:40,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1593 states and 1917 transitions. [2020-12-01 17:54:40,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 1917 transitions. [2020-12-01 17:54:40,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-12-01 17:54:40,522 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:40,811 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-01 17:54:44,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:44,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1618 states and 1948 transitions. [2020-12-01 17:54:44,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 1948 transitions. [2020-12-01 17:54:44,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-12-01 17:54:44,157 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:44,286 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-01 17:54:44,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:44,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1625 states and 1956 transitions. [2020-12-01 17:54:44,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 1956 transitions. [2020-12-01 17:54:44,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-12-01 17:54:44,901 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:45,003 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-01 17:54:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1630 states and 1961 transitions. [2020-12-01 17:54:45,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 1961 transitions. [2020-12-01 17:54:45,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-12-01 17:54:45,897 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:46,037 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-01 17:54:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1635 states and 1966 transitions. [2020-12-01 17:54:46,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 1966 transitions. [2020-12-01 17:54:46,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-12-01 17:54:46,788 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:46,904 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-01 17:54:48,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:48,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1645 states and 1975 transitions. [2020-12-01 17:54:48,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 1975 transitions. [2020-12-01 17:54:48,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-12-01 17:54:48,251 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:48,334 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-01 17:54:49,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:49,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1650 states and 1979 transitions. [2020-12-01 17:54:49,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 1979 transitions. [2020-12-01 17:54:49,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-12-01 17:54:49,155 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:49,220 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-01 17:54:53,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:53,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 1670 states and 2008 transitions. [2020-12-01 17:54:53,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2008 transitions. [2020-12-01 17:54:53,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-12-01 17:54:53,669 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:53,769 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-01 17:54:55,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:55,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 1676 states and 2013 transitions. [2020-12-01 17:54:55,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2013 transitions. [2020-12-01 17:54:55,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2020-12-01 17:54:55,479 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-01 17:54:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:57,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 1701 states and 2043 transitions. [2020-12-01 17:54:57,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2043 transitions. [2020-12-01 17:54:57,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2020-12-01 17:54:57,334 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:57,402 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-01 17:54:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 1706 states and 2048 transitions. [2020-12-01 17:54:58,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2048 transitions. [2020-12-01 17:54:58,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2020-12-01 17:54:58,204 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:58,285 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-01 17:54:59,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:54:59,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 1713 states and 2056 transitions. [2020-12-01 17:54:59,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2056 transitions. [2020-12-01 17:54:59,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-12-01 17:54:59,133 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:54:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:54:59,393 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 111 proven. 43 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 17:55:02,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:02,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 1726 states and 2084 transitions. [2020-12-01 17:55:02,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2084 transitions. [2020-12-01 17:55:02,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-12-01 17:55:02,055 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:02,111 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-12-01 17:55:02,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 1727 states and 2086 transitions. [2020-12-01 17:55:02,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2086 transitions. [2020-12-01 17:55:02,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-12-01 17:55:02,643 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 104 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:55:09,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:09,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 1766 states and 2140 transitions. [2020-12-01 17:55:09,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2140 transitions. [2020-12-01 17:55:09,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-12-01 17:55:09,795 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 104 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 17:55:11,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:11,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2143 states to 1771 states and 2143 transitions. [2020-12-01 17:55:11,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2143 transitions. [2020-12-01 17:55:11,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-12-01 17:55:11,584 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 9 proven. 92 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2020-12-01 17:55:14,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:14,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 1851 states and 2228 transitions. [2020-12-01 17:55:14,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2228 transitions. [2020-12-01 17:55:14,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-12-01 17:55:14,155 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:14,209 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-12-01 17:55:17,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:17,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 1866 states and 2248 transitions. [2020-12-01 17:55:17,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2248 transitions. [2020-12-01 17:55:17,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-12-01 17:55:17,387 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:17,460 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-12-01 17:55:18,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:18,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 1870 states and 2251 transitions. [2020-12-01 17:55:18,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2251 transitions. [2020-12-01 17:55:18,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-12-01 17:55:18,226 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-01 17:55:19,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:19,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 1890 states and 2272 transitions. [2020-12-01 17:55:19,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2272 transitions. [2020-12-01 17:55:19,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-12-01 17:55:19,333 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:19,402 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-01 17:55:19,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:19,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 1892 states and 2273 transitions. [2020-12-01 17:55:19,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2273 transitions. [2020-12-01 17:55:19,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-12-01 17:55:19,798 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:20,235 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-12-01 17:55:23,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:23,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 1929 states and 2325 transitions. [2020-12-01 17:55:23,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2325 transitions. [2020-12-01 17:55:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-12-01 17:55:23,449 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:23,496 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-12-01 17:55:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:24,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2331 states to 1934 states and 2331 transitions. [2020-12-01 17:55:24,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2331 transitions. [2020-12-01 17:55:24,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-12-01 17:55:24,631 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:24,699 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-12-01 17:55:25,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:25,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2339 states to 1942 states and 2339 transitions. [2020-12-01 17:55:25,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2339 transitions. [2020-12-01 17:55:25,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-12-01 17:55:25,296 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:25,490 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-12-01 17:55:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:26,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 1944 states and 2340 transitions. [2020-12-01 17:55:26,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1944 states and 2340 transitions. [2020-12-01 17:55:26,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2020-12-01 17:55:26,025 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:26,100 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:55:27,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:27,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 1961 states and 2358 transitions. [2020-12-01 17:55:27,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2358 transitions. [2020-12-01 17:55:27,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2020-12-01 17:55:27,145 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:55:27,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:27,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 1968 states and 2365 transitions. [2020-12-01 17:55:27,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2365 transitions. [2020-12-01 17:55:27,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2020-12-01 17:55:27,832 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:27,930 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:55:28,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:28,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 1973 states and 2369 transitions. [2020-12-01 17:55:28,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 2369 transitions. [2020-12-01 17:55:28,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-12-01 17:55:28,409 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:28,843 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 135 proven. 46 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:55:36,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:36,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2001 states and 2411 transitions. [2020-12-01 17:55:36,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 2411 transitions. [2020-12-01 17:55:36,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-12-01 17:55:36,371 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:36,499 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 135 proven. 46 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:55:36,782 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2020-12-01 17:55:39,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:39,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2015 states and 2427 transitions. [2020-12-01 17:55:39,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2427 transitions. [2020-12-01 17:55:39,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-12-01 17:55:39,007 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 17:55:39,159 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 135 proven. 46 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-01 17:55:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 17:55:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2020 states and 2434 transitions. [2020-12-01 17:55:40,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2434 transitions. [2020-12-01 17:55:40,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-12-01 17:55:40,323 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 17:55:40,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:55:40,368 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:55:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:55:40,457 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:55:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:55:40,688 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:55:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 17:55:40,755 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 17:55:45,976 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 121 iterations. [2020-12-01 17:55:46,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 05:55:46 ImpRootNode [2020-12-01 17:55:46,246 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2020-12-01 17:55:46,247 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 17:55:46,247 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 17:55:46,247 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 17:55:46,248 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:53:16" (3/4) ... [2020-12-01 17:55:46,252 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 17:55:46,458 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e26c40c6-035f-4111-90fd-bde8910809df/bin/ukojak/witness.graphml [2020-12-01 17:55:46,458 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 17:55:46,459 INFO L168 Benchmark]: Toolchain (without parser) took 153065.47 ms. Allocated memory was 100.7 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 66.2 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 830.4 MB. Max. memory is 16.1 GB. [2020-12-01 17:55:46,460 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 71.3 MB. Free memory was 31.5 MB in the beginning and 31.4 MB in the end (delta: 67.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 17:55:46,460 INFO L168 Benchmark]: CACSL2BoogieTranslator took 650.73 ms. Allocated memory is still 100.7 MB. Free memory was 66.0 MB in the beginning and 60.4 MB in the end (delta: 5.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-01 17:55:46,461 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.29 ms. Allocated memory is still 100.7 MB. Free memory was 60.4 MB in the beginning and 55.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-01 17:55:46,461 INFO L168 Benchmark]: Boogie Preprocessor took 58.67 ms. Allocated memory is still 100.7 MB. Free memory was 55.1 MB in the beginning and 49.9 MB in the end (delta: 5.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-01 17:55:46,461 INFO L168 Benchmark]: RCFGBuilder took 2606.29 ms. Allocated memory was 100.7 MB in the beginning and 134.2 MB in the end (delta: 33.6 MB). Free memory was 49.9 MB in the beginning and 50.5 MB in the end (delta: -566.6 kB). Peak memory consumption was 41.3 MB. Max. memory is 16.1 GB. [2020-12-01 17:55:46,462 INFO L168 Benchmark]: CodeCheck took 149422.17 ms. Allocated memory was 134.2 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 50.5 MB in the beginning and 1.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 750.6 MB. Max. memory is 16.1 GB. [2020-12-01 17:55:46,462 INFO L168 Benchmark]: Witness Printer took 211.79 ms. Allocated memory is still 2.2 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. [2020-12-01 17:55:46,464 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: 149.0s, OverallIterations: 121, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1117184 SDtfs, -24494374 SDslu, 9849856 SDs, 0 SdLazy, 878288736 SolverSat, 455373034 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 674.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110621 GetRequests, 105843 SyntacticMatches, 3788 SemanticMatches, 990 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626123 ImplicationChecksByTransitivity, 115.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.7s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 16433 NumberOfCodeBlocks, 16433 NumberOfCodeBlocksAsserted, 121 NumberOfCheckSat, 16119 ConstructedInterpolants, 0 QuantifiedInterpolants, 7825439 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 120 InterpolantComputations, 103 PerfectInterpolantSequences, 10079/10750 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 TRUE (((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)) [L65] a7 = 0 [L66] a20 = 1 [L67] a21 = 1 [L68] a16 = 4 [L69] a17 = 1 [L70] a8 = 13 [L71] return -1; VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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 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=1, a20=1, a21=1, a7=0, a8=13, 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=1, a20=1, a21=1, a7=0, a8=13, 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=1, a20=1, a21=1, a7=0, a8=13, 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=1, a20=1, a21=1, a7=0, a8=13, 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=1, a20=1, a21=1, a7=0, a8=13, 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=1, a20=1, a21=1, a7=0, a8=13, 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=1, a20=1, a21=1, a7=0, a8=13, 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=1, a20=1, a21=1, a7=0, a8=13, 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=1, a20=1, a21=1, a7=0, a8=13, 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=1, a20=1, a21=1, a7=0, a8=13, 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=1, a20=1, a21=1, a7=0, a8=13, 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=1, a20=1, a21=1, a7=0, a8=13, 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=1, a20=1, a21=1, a7=0, a8=13, 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=1, a20=1, a21=1, a7=0, a8=13, 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=1, a20=1, a21=1, a7=0, a8=13, 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=1, a20=1, a21=1, a7=0, a8=13, 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=1, a20=1, a21=1, a7=0, a8=13, 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=1, a20=1, a21=1, a7=0, a8=13, 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=1, a20=1, a21=1, a7=0, a8=13, 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=1, a20=1, a21=1, a7=0, a8=13, 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=1, a20=1, a21=1, a7=0, a8=13, 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=1, a20=1, a21=1, a7=0, a8=13, 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=1, a20=1, a21=1, a7=0, a8=13, 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=1, a20=1, a21=1, a7=0, a8=13, 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)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L419] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L422] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L425] COND TRUE (((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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_label35.c", 4, "reach_error") VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, 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.24 ms. Allocated memory is still 71.3 MB. Free memory was 31.5 MB in the beginning and 31.4 MB in the end (delta: 67.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 650.73 ms. Allocated memory is still 100.7 MB. Free memory was 66.0 MB in the beginning and 60.4 MB in the end (delta: 5.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 107.29 ms. Allocated memory is still 100.7 MB. Free memory was 60.4 MB in the beginning and 55.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 58.67 ms. Allocated memory is still 100.7 MB. Free memory was 55.1 MB in the beginning and 49.9 MB in the end (delta: 5.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2606.29 ms. Allocated memory was 100.7 MB in the beginning and 134.2 MB in the end (delta: 33.6 MB). Free memory was 49.9 MB in the beginning and 50.5 MB in the end (delta: -566.6 kB). Peak memory consumption was 41.3 MB. Max. memory is 16.1 GB. * CodeCheck took 149422.17 ms. Allocated memory was 134.2 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 50.5 MB in the beginning and 1.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 750.6 MB. Max. memory is 16.1 GB. * Witness Printer took 211.79 ms. Allocated memory is still 2.2 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...