./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label15_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4e107a2e-80e0-4d00-b3a2-df8645fdb0ec/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4e107a2e-80e0-4d00-b3a2-df8645fdb0ec/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4e107a2e-80e0-4d00-b3a2-df8645fdb0ec/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4e107a2e-80e0-4d00-b3a2-df8645fdb0ec/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label15_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4e107a2e-80e0-4d00-b3a2-df8645fdb0ec/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4e107a2e-80e0-4d00-b3a2-df8645fdb0ec/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4893d056c55084f9785b9d10ff20a8939e2b3502 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 14:17:46,082 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:17:46,084 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:17:46,090 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:17:46,091 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:17:46,091 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:17:46,092 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:17:46,093 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:17:46,095 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:17:46,095 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:17:46,096 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:17:46,096 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:17:46,097 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:17:46,097 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:17:46,098 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:17:46,098 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:17:46,098 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:17:46,100 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:17:46,101 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:17:46,102 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:17:46,103 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:17:46,104 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:17:46,105 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:17:46,106 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:17:46,106 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:17:46,106 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:17:46,107 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:17:46,107 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:17:46,108 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:17:46,109 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:17:46,109 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:17:46,109 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:17:46,110 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:17:46,110 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:17:46,110 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:17:46,111 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:17:46,111 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4e107a2e-80e0-4d00-b3a2-df8645fdb0ec/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-18 14:17:46,121 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:17:46,121 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:17:46,122 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 14:17:46,122 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 14:17:46,122 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 14:17:46,122 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 14:17:46,122 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:17:46,123 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:17:46,123 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:17:46,123 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:17:46,123 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:17:46,123 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 14:17:46,123 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 14:17:46,123 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 14:17:46,123 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:17:46,123 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:17:46,124 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:17:46,124 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 14:17:46,124 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-18 14:17:46,124 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-18 14:17:46,124 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:17:46,124 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 14:17:46,124 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 14:17:46,125 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:17:46,125 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 14:17:46,125 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 14:17:46,125 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-18 14:17:46,125 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 14:17:46,125 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 14:17:46,125 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_4e107a2e-80e0-4d00-b3a2-df8645fdb0ec/bin-2019/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(__VERIFIER_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 -> 4893d056c55084f9785b9d10ff20a8939e2b3502 [2018-11-18 14:17:46,152 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:17:46,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:17:46,163 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:17:46,164 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:17:46,164 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:17:46,165 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4e107a2e-80e0-4d00-b3a2-df8645fdb0ec/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label15_false-unreach-call_false-termination.c [2018-11-18 14:17:46,204 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4e107a2e-80e0-4d00-b3a2-df8645fdb0ec/bin-2019/ukojak/data/dd3011fa0/5d41917e9904428fa22f16d06610e452/FLAG68994ec79 [2018-11-18 14:17:46,577 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:17:46,578 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4e107a2e-80e0-4d00-b3a2-df8645fdb0ec/sv-benchmarks/c/eca-rers2012/Problem01_label15_false-unreach-call_false-termination.c [2018-11-18 14:17:46,587 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4e107a2e-80e0-4d00-b3a2-df8645fdb0ec/bin-2019/ukojak/data/dd3011fa0/5d41917e9904428fa22f16d06610e452/FLAG68994ec79 [2018-11-18 14:17:46,597 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4e107a2e-80e0-4d00-b3a2-df8645fdb0ec/bin-2019/ukojak/data/dd3011fa0/5d41917e9904428fa22f16d06610e452 [2018-11-18 14:17:46,599 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:17:46,600 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 14:17:46,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:17:46,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:17:46,603 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:17:46,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:17:46" (1/1) ... [2018-11-18 14:17:46,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11524d60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:17:46, skipping insertion in model container [2018-11-18 14:17:46,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:17:46" (1/1) ... [2018-11-18 14:17:46,612 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:17:46,645 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:17:46,886 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:17:46,890 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:17:46,957 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:17:46,970 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:17:46,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:17:46 WrapperNode [2018-11-18 14:17:46,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:17:46,971 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 14:17:46,971 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 14:17:46,971 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 14:17:47,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:17:46" (1/1) ... [2018-11-18 14:17:47,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:17:46" (1/1) ... [2018-11-18 14:17:47,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 14:17:47,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:17:47,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:17:47,076 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:17:47,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:17:46" (1/1) ... [2018-11-18 14:17:47,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:17:46" (1/1) ... [2018-11-18 14:17:47,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:17:46" (1/1) ... [2018-11-18 14:17:47,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:17:46" (1/1) ... [2018-11-18 14:17:47,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:17:46" (1/1) ... [2018-11-18 14:17:47,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:17:46" (1/1) ... [2018-11-18 14:17:47,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:17:46" (1/1) ... [2018-11-18 14:17:47,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:17:47,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:17:47,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:17:47,119 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:17:47,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:17:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e107a2e-80e0-4d00-b3a2-df8645fdb0ec/bin-2019/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 [2018-11-18 14:17:47,169 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 14:17:47,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:17:47,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:17:48,512 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:17:48,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:17:48 BoogieIcfgContainer [2018-11-18 14:17:48,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:17:48,513 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-18 14:17:48,513 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-18 14:17:48,520 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-18 14:17:48,521 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:17:48" (1/1) ... [2018-11-18 14:17:48,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:17:48,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:48,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-11-18 14:17:48,554 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-11-18 14:17:48,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 14:17:48,558 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:48,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:17:49,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:49,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 147 states and 223 transitions. [2018-11-18 14:17:49,279 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 223 transitions. [2018-11-18 14:17:49,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 14:17:49,281 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:49,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:17:49,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 218 states and 317 transitions. [2018-11-18 14:17:49,744 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 317 transitions. [2018-11-18 14:17:49,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 14:17:49,748 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:49,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:17:49,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:49,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 224 states and 330 transitions. [2018-11-18 14:17:49,922 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 330 transitions. [2018-11-18 14:17:49,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 14:17:49,925 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:17:50,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:50,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 295 states and 409 transitions. [2018-11-18 14:17:50,629 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 409 transitions. [2018-11-18 14:17:50,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 14:17:50,631 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:17:50,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:50,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 298 states and 413 transitions. [2018-11-18 14:17:50,700 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 413 transitions. [2018-11-18 14:17:50,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 14:17:50,701 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:17:50,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:50,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 310 states and 434 transitions. [2018-11-18 14:17:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 434 transitions. [2018-11-18 14:17:50,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-18 14:17:50,950 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:50,994 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:17:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:51,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 323 states and 456 transitions. [2018-11-18 14:17:51,303 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 456 transitions. [2018-11-18 14:17:51,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-18 14:17:51,303 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:51,331 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:17:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:51,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 328 states and 466 transitions. [2018-11-18 14:17:51,498 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 466 transitions. [2018-11-18 14:17:51,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-18 14:17:51,500 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:17:52,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 343 states and 486 transitions. [2018-11-18 14:17:52,078 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 486 transitions. [2018-11-18 14:17:52,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-18 14:17:52,079 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:52,120 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 14:17:52,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 344 states and 488 transitions. [2018-11-18 14:17:52,209 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 488 transitions. [2018-11-18 14:17:52,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-18 14:17:52,210 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 14:17:52,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 348 states and 493 transitions. [2018-11-18 14:17:52,306 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 493 transitions. [2018-11-18 14:17:52,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-18 14:17:52,306 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:17:52,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:52,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 353 states and 499 transitions. [2018-11-18 14:17:52,504 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 499 transitions. [2018-11-18 14:17:52,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-18 14:17:52,505 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:52,525 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 14:17:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:52,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 354 states and 501 transitions. [2018-11-18 14:17:52,623 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 501 transitions. [2018-11-18 14:17:52,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-18 14:17:52,624 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 14:17:52,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 358 states and 506 transitions. [2018-11-18 14:17:52,747 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 506 transitions. [2018-11-18 14:17:52,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 14:17:52,747 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:52,838 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:17:53,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:53,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 369 states and 521 transitions. [2018-11-18 14:17:53,632 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 521 transitions. [2018-11-18 14:17:53,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 14:17:53,633 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:53,654 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 14:17:53,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:53,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 383 states and 538 transitions. [2018-11-18 14:17:53,915 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 538 transitions. [2018-11-18 14:17:53,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-18 14:17:53,916 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:53,935 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:17:54,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:54,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 390 states and 547 transitions. [2018-11-18 14:17:54,115 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 547 transitions. [2018-11-18 14:17:54,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-18 14:17:54,116 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:54,136 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:17:54,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:54,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 398 states and 557 transitions. [2018-11-18 14:17:54,261 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 557 transitions. [2018-11-18 14:17:54,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-18 14:17:54,262 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:54,282 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:17:54,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:54,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 399 states and 558 transitions. [2018-11-18 14:17:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 558 transitions. [2018-11-18 14:17:54,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-18 14:17:54,303 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 14:17:54,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:54,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 406 states and 565 transitions. [2018-11-18 14:17:54,459 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 565 transitions. [2018-11-18 14:17:54,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 14:17:54,461 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:54,574 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:17:54,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:54,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 421 states and 584 transitions. [2018-11-18 14:17:54,912 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 584 transitions. [2018-11-18 14:17:54,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-18 14:17:54,913 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:54,938 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:17:54,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:54,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 422 states and 586 transitions. [2018-11-18 14:17:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 586 transitions. [2018-11-18 14:17:54,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-18 14:17:54,964 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:55,039 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:17:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:55,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 430 states and 595 transitions. [2018-11-18 14:17:55,218 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 595 transitions. [2018-11-18 14:17:55,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 14:17:55,219 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:55,284 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 14:17:55,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:55,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 440 states and 609 transitions. [2018-11-18 14:17:55,475 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 609 transitions. [2018-11-18 14:17:55,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 14:17:55,476 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:17:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 441 states and 611 transitions. [2018-11-18 14:17:55,518 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 611 transitions. [2018-11-18 14:17:55,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 14:17:55,519 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 14:17:56,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:56,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 458 states and 629 transitions. [2018-11-18 14:17:56,052 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 629 transitions. [2018-11-18 14:17:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 14:17:56,053 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:56,078 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 14:17:56,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:56,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 459 states and 631 transitions. [2018-11-18 14:17:56,111 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 631 transitions. [2018-11-18 14:17:56,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 14:17:56,112 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 14:17:56,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:56,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 460 states and 633 transitions. [2018-11-18 14:17:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 633 transitions. [2018-11-18 14:17:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 14:17:56,251 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:56,283 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:17:56,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:56,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 477 states and 651 transitions. [2018-11-18 14:17:56,756 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 651 transitions. [2018-11-18 14:17:56,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 14:17:56,757 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:56,777 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 14:17:56,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:56,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 479 states and 653 transitions. [2018-11-18 14:17:56,797 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 653 transitions. [2018-11-18 14:17:56,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 14:17:56,797 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:56,836 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:17:57,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:57,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 484 states and 659 transitions. [2018-11-18 14:17:57,176 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 659 transitions. [2018-11-18 14:17:57,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-18 14:17:57,177 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:57,350 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:17:57,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 498 states and 673 transitions. [2018-11-18 14:17:57,796 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 673 transitions. [2018-11-18 14:17:57,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-18 14:17:57,796 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:57,811 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 14:17:57,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 503 states and 678 transitions. [2018-11-18 14:17:57,830 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 678 transitions. [2018-11-18 14:17:57,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-18 14:17:57,831 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:57,850 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 14:17:58,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:58,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 508 states and 684 transitions. [2018-11-18 14:17:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 684 transitions. [2018-11-18 14:17:58,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-18 14:17:58,090 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:58,118 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 14:17:58,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:58,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 516 states and 692 transitions. [2018-11-18 14:17:58,158 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 692 transitions. [2018-11-18 14:17:58,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-18 14:17:58,158 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:58,367 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 14:17:59,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:59,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 547 states and 728 transitions. [2018-11-18 14:17:59,492 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 728 transitions. [2018-11-18 14:17:59,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-18 14:17:59,493 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:59,517 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 14:17:59,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:17:59,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 548 states and 729 transitions. [2018-11-18 14:17:59,545 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 729 transitions. [2018-11-18 14:17:59,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-18 14:17:59,545 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:17:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:17:59,878 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:18:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:00,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 562 states and 753 transitions. [2018-11-18 14:18:00,965 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 753 transitions. [2018-11-18 14:18:00,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-18 14:18:00,965 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:01,029 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:18:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 568 states and 761 transitions. [2018-11-18 14:18:01,348 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 761 transitions. [2018-11-18 14:18:01,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-18 14:18:01,348 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:01,397 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:18:01,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:01,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 571 states and 763 transitions. [2018-11-18 14:18:01,537 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 763 transitions. [2018-11-18 14:18:01,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-18 14:18:01,537 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:01,587 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:18:01,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:01,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 580 states and 772 transitions. [2018-11-18 14:18:01,744 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 772 transitions. [2018-11-18 14:18:01,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-18 14:18:01,745 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 14:18:02,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:02,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 583 states and 777 transitions. [2018-11-18 14:18:02,169 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 777 transitions. [2018-11-18 14:18:02,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-18 14:18:02,170 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 14:18:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 600 states and 795 transitions. [2018-11-18 14:18:02,635 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 795 transitions. [2018-11-18 14:18:02,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-18 14:18:02,635 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:02,675 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-18 14:18:02,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 601 states and 798 transitions. [2018-11-18 14:18:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 798 transitions. [2018-11-18 14:18:02,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 14:18:02,698 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:02,717 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 14:18:02,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:02,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 610 states and 808 transitions. [2018-11-18 14:18:02,763 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 808 transitions. [2018-11-18 14:18:02,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 14:18:02,763 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:02,788 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 14:18:02,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:02,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 619 states and 817 transitions. [2018-11-18 14:18:02,826 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 817 transitions. [2018-11-18 14:18:02,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 14:18:02,827 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:02,845 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 14:18:03,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:03,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 631 states and 832 transitions. [2018-11-18 14:18:03,057 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 832 transitions. [2018-11-18 14:18:03,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-18 14:18:03,057 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:03,108 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 14:18:04,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:04,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 768 states and 980 transitions. [2018-11-18 14:18:04,404 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 980 transitions. [2018-11-18 14:18:04,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-18 14:18:04,404 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 14:18:04,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 769 states and 981 transitions. [2018-11-18 14:18:04,447 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 981 transitions. [2018-11-18 14:18:04,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-18 14:18:04,448 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 14:18:04,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 782 states and 994 transitions. [2018-11-18 14:18:04,594 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 994 transitions. [2018-11-18 14:18:04,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-18 14:18:04,595 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:04,621 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 14:18:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:04,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 783 states and 995 transitions. [2018-11-18 14:18:04,635 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 995 transitions. [2018-11-18 14:18:04,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-18 14:18:04,636 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:04,894 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 14:18:05,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:05,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 825 states and 1039 transitions. [2018-11-18 14:18:05,945 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1039 transitions. [2018-11-18 14:18:05,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 14:18:05,946 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 14:18:08,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:08,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 888 states and 1126 transitions. [2018-11-18 14:18:08,940 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1126 transitions. [2018-11-18 14:18:08,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 14:18:08,941 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:09,053 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 14:18:09,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:09,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 918 states and 1156 transitions. [2018-11-18 14:18:09,696 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1156 transitions. [2018-11-18 14:18:09,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 14:18:09,696 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:09,783 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 14:18:10,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:10,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 925 states and 1162 transitions. [2018-11-18 14:18:10,020 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1162 transitions. [2018-11-18 14:18:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 14:18:10,021 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 14:18:10,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:10,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 926 states and 1164 transitions. [2018-11-18 14:18:10,384 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1164 transitions. [2018-11-18 14:18:10,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 14:18:10,384 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 14:18:10,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:10,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 930 states and 1169 transitions. [2018-11-18 14:18:10,761 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1169 transitions. [2018-11-18 14:18:10,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-18 14:18:10,762 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 14:18:11,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:11,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 947 states and 1188 transitions. [2018-11-18 14:18:11,324 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1188 transitions. [2018-11-18 14:18:11,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-18 14:18:11,325 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:11,345 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 14:18:11,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:11,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 951 states and 1193 transitions. [2018-11-18 14:18:11,508 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1193 transitions. [2018-11-18 14:18:11,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-18 14:18:11,509 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:11,607 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 14:18:12,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:12,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 997 states and 1245 transitions. [2018-11-18 14:18:12,317 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1245 transitions. [2018-11-18 14:18:12,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-18 14:18:12,318 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:12,344 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 14:18:12,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1010 states and 1257 transitions. [2018-11-18 14:18:12,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1257 transitions. [2018-11-18 14:18:12,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-18 14:18:12,628 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:12,646 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 14:18:12,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:12,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1015 states and 1264 transitions. [2018-11-18 14:18:12,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1264 transitions. [2018-11-18 14:18:12,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-18 14:18:12,675 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 14:18:12,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:12,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1022 states and 1271 transitions. [2018-11-18 14:18:12,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1271 transitions. [2018-11-18 14:18:12,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-18 14:18:12,723 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:12,744 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 14:18:12,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:12,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1029 states and 1279 transitions. [2018-11-18 14:18:12,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1279 transitions. [2018-11-18 14:18:12,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-18 14:18:12,867 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:12,891 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 14:18:13,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1035 states and 1286 transitions. [2018-11-18 14:18:13,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1286 transitions. [2018-11-18 14:18:13,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-18 14:18:13,104 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 14:18:13,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:13,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1044 states and 1297 transitions. [2018-11-18 14:18:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1297 transitions. [2018-11-18 14:18:13,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-18 14:18:13,170 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 14:18:14,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:14,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1070 states and 1334 transitions. [2018-11-18 14:18:14,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1334 transitions. [2018-11-18 14:18:14,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-18 14:18:14,629 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:14,684 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 14:18:15,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:15,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1083 states and 1349 transitions. [2018-11-18 14:18:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1349 transitions. [2018-11-18 14:18:15,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-18 14:18:15,333 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:15,364 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 14:18:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1088 states and 1355 transitions. [2018-11-18 14:18:15,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1355 transitions. [2018-11-18 14:18:15,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-18 14:18:15,670 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:15,702 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 14:18:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:16,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1097 states and 1365 transitions. [2018-11-18 14:18:16,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1365 transitions. [2018-11-18 14:18:16,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-18 14:18:16,274 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 167 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:18:18,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1116 states and 1391 transitions. [2018-11-18 14:18:18,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1391 transitions. [2018-11-18 14:18:18,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-18 14:18:18,391 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:18,452 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 167 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:18:18,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:18,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1122 states and 1398 transitions. [2018-11-18 14:18:18,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1398 transitions. [2018-11-18 14:18:18,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-18 14:18:18,937 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 167 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:18:19,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:19,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1136 states and 1414 transitions. [2018-11-18 14:18:19,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1414 transitions. [2018-11-18 14:18:19,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-18 14:18:19,745 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:19,771 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 14:18:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1147 states and 1425 transitions. [2018-11-18 14:18:19,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1425 transitions. [2018-11-18 14:18:19,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-18 14:18:19,808 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:19,833 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 14:18:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1148 states and 1426 transitions. [2018-11-18 14:18:19,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1426 transitions. [2018-11-18 14:18:19,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-18 14:18:19,851 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:19,889 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 14:18:19,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:19,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1160 states and 1439 transitions. [2018-11-18 14:18:19,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1439 transitions. [2018-11-18 14:18:19,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-18 14:18:19,965 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 14:18:20,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:20,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1161 states and 1442 transitions. [2018-11-18 14:18:20,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1442 transitions. [2018-11-18 14:18:20,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-18 14:18:20,261 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:20,299 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 14:18:20,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:20,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1165 states and 1447 transitions. [2018-11-18 14:18:20,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1447 transitions. [2018-11-18 14:18:20,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-18 14:18:20,558 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:18:22,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1176 states and 1466 transitions. [2018-11-18 14:18:22,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1466 transitions. [2018-11-18 14:18:22,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-18 14:18:22,834 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:22,897 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:18:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:23,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1183 states and 1475 transitions. [2018-11-18 14:18:23,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1475 transitions. [2018-11-18 14:18:23,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-18 14:18:23,781 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:23,851 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:18:24,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:24,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1192 states and 1485 transitions. [2018-11-18 14:18:24,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1485 transitions. [2018-11-18 14:18:24,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-18 14:18:24,402 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 160 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:18:26,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:26,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1267 states and 1573 transitions. [2018-11-18 14:18:26,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1573 transitions. [2018-11-18 14:18:26,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-18 14:18:26,801 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 160 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:18:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:28,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1280 states and 1589 transitions. [2018-11-18 14:18:28,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1589 transitions. [2018-11-18 14:18:28,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 14:18:28,009 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:28,049 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 14:18:29,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:29,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1312 states and 1630 transitions. [2018-11-18 14:18:29,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1630 transitions. [2018-11-18 14:18:29,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 14:18:29,546 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:29,589 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 14:18:30,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:30,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1318 states and 1638 transitions. [2018-11-18 14:18:30,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1638 transitions. [2018-11-18 14:18:30,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 14:18:30,200 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:30,241 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 14:18:30,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:30,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1322 states and 1642 transitions. [2018-11-18 14:18:30,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1642 transitions. [2018-11-18 14:18:30,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 14:18:30,546 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:30,587 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 14:18:30,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:30,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1326 states and 1646 transitions. [2018-11-18 14:18:30,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1646 transitions. [2018-11-18 14:18:30,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-18 14:18:30,975 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:31,029 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 14:18:31,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:31,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1331 states and 1655 transitions. [2018-11-18 14:18:31,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1655 transitions. [2018-11-18 14:18:31,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-18 14:18:31,706 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:31,753 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 14:18:33,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:33,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1356 states and 1694 transitions. [2018-11-18 14:18:33,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1694 transitions. [2018-11-18 14:18:33,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-18 14:18:33,866 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:33,910 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 14:18:34,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:34,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1370 states and 1708 transitions. [2018-11-18 14:18:34,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1708 transitions. [2018-11-18 14:18:34,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-18 14:18:34,364 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 14:18:35,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:35,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1377 states and 1721 transitions. [2018-11-18 14:18:35,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1721 transitions. [2018-11-18 14:18:35,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-18 14:18:35,391 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 14:18:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:36,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1390 states and 1735 transitions. [2018-11-18 14:18:36,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1735 transitions. [2018-11-18 14:18:36,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-18 14:18:36,512 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:36,556 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 14:18:36,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1395 states and 1741 transitions. [2018-11-18 14:18:36,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1741 transitions. [2018-11-18 14:18:36,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-18 14:18:36,925 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:37,574 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-18 14:18:38,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:38,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1426 states and 1778 transitions. [2018-11-18 14:18:38,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1778 transitions. [2018-11-18 14:18:38,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-18 14:18:38,989 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:39,024 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 14:18:39,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:39,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1452 states and 1806 transitions. [2018-11-18 14:18:39,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1806 transitions. [2018-11-18 14:18:39,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-18 14:18:39,723 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:39,796 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 14:18:40,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:40,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1456 states and 1810 transitions. [2018-11-18 14:18:40,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1810 transitions. [2018-11-18 14:18:40,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-18 14:18:40,089 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:40,121 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 14:18:40,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:40,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1461 states and 1815 transitions. [2018-11-18 14:18:40,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 1815 transitions. [2018-11-18 14:18:40,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-18 14:18:40,653 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:40,685 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-18 14:18:41,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:41,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1472 states and 1827 transitions. [2018-11-18 14:18:41,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 1827 transitions. [2018-11-18 14:18:41,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-18 14:18:41,378 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:41,412 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-18 14:18:41,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:41,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1475 states and 1830 transitions. [2018-11-18 14:18:41,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1830 transitions. [2018-11-18 14:18:41,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-18 14:18:41,833 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-18 14:18:42,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:42,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1480 states and 1837 transitions. [2018-11-18 14:18:42,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1837 transitions. [2018-11-18 14:18:42,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-18 14:18:42,129 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:42,934 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-18 14:18:44,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:44,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1503 states and 1866 transitions. [2018-11-18 14:18:44,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1866 transitions. [2018-11-18 14:18:44,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-18 14:18:44,632 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:45,304 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 258 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-18 14:18:47,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:47,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1524 states and 1890 transitions. [2018-11-18 14:18:47,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1890 transitions. [2018-11-18 14:18:47,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-18 14:18:47,280 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-18 14:18:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1553 states and 1926 transitions. [2018-11-18 14:18:50,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 1926 transitions. [2018-11-18 14:18:50,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-18 14:18:50,141 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:50,178 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-18 14:18:50,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:50,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1557 states and 1931 transitions. [2018-11-18 14:18:50,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1931 transitions. [2018-11-18 14:18:50,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-18 14:18:50,471 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:50,502 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-18 14:18:51,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:51,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1563 states and 1937 transitions. [2018-11-18 14:18:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1937 transitions. [2018-11-18 14:18:51,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-18 14:18:51,338 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-18 14:18:51,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:51,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1567 states and 1940 transitions. [2018-11-18 14:18:51,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 1940 transitions. [2018-11-18 14:18:51,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-18 14:18:51,809 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-18 14:18:52,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:52,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1583 states and 1957 transitions. [2018-11-18 14:18:52,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 1957 transitions. [2018-11-18 14:18:52,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-18 14:18:52,742 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:53,946 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-18 14:18:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1614 states and 1993 transitions. [2018-11-18 14:18:56,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 1993 transitions. [2018-11-18 14:18:56,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-18 14:18:56,609 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:18:56,718 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-18 14:18:58,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 14:18:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 1631 states and 2010 transitions. [2018-11-18 14:18:58,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2010 transitions. [2018-11-18 14:18:58,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-18 14:18:58,250 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 14:18:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:18:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:18:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:18:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:18:58,492 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 110 iterations. [2018-11-18 14:18:58,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 18.11 02:18:58 ImpRootNode [2018-11-18 14:18:58,624 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-18 14:18:58,625 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:18:58,625 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:18:58,625 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:18:58,625 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:17:48" (3/4) ... [2018-11-18 14:18:58,629 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 14:18:58,751 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4e107a2e-80e0-4d00-b3a2-df8645fdb0ec/bin-2019/ukojak/witness.graphml [2018-11-18 14:18:58,751 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:18:58,751 INFO L168 Benchmark]: Toolchain (without parser) took 72151.93 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 956.6 MB in the beginning and 1.5 GB in the end (delta: -543.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-18 14:18:58,752 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:18:58,753 INFO L168 Benchmark]: CACSL2BoogieTranslator took 369.82 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 919.0 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-11-18 14:18:58,753 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 919.0 MB in the beginning and 1.1 GB in the end (delta: -198.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-18 14:18:58,753 INFO L168 Benchmark]: Boogie Preprocessor took 43.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:18:58,753 INFO L168 Benchmark]: RCFGBuilder took 1394.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 885.3 MB in the end (delta: 232.2 MB). Peak memory consumption was 232.2 MB. Max. memory is 11.5 GB. [2018-11-18 14:18:58,753 INFO L168 Benchmark]: CodeCheck took 70111.31 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 885.3 MB in the beginning and 1.5 GB in the end (delta: -615.1 MB). Peak memory consumption was 886.4 MB. Max. memory is 11.5 GB. [2018-11-18 14:18:58,754 INFO L168 Benchmark]: Witness Printer took 125.99 ms. Allocated memory is still 2.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-18 14:18:58,755 INFO L336 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, 199 locations, 1 error locations. UNSAFE Result, 69.9s OverallTime, 110 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 465226128 SDtfs, -996635136 SDslu, -1551896744 SDs, 0 SdLazy, -183351132 SolverSat, 1777368236 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 254.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108663 GetRequests, 104578 SyntacticMatches, 3167 SemanticMatches, 918 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556712 ImplicationChecksByTransitivity, 58.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 16346 NumberOfCodeBlocks, 16346 NumberOfCodeBlocksAsserted, 110 NumberOfCheckSat, 16016 ConstructedInterpolants, 0 QuantifiedInterpolants, 10595289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 109 InterpolantComputations, 84 PerfectInterpolantSequences, 12502/12810 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 419]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] 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] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] 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] [L35] 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] [L43] 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] [L49] 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] [L54] 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] [L62] 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] [L65] 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] [L72] 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] [L80] 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] [L84] 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] [L92] 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] [L97] 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] [L102] 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] [L108] 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] [L114] 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] [L119] 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] [L124] 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] [L129] 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] [L136] 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] [L140] 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] [L144] 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] [L148] 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] [L152] 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] [L160] 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] [L165] 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] [L173] 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] [L178] 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] [L186] 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] [L189] 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] [L194] 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] [L197] 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] [L203] 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] [L208] 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] [L214] 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] [L218] 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] [L223] 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] [L231] 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] [L238] 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] [L245] 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] [L250] 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] [L256] 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] [L261] 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] [L265] 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] [L268] 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] [L273] 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] [L278] 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] [L286] 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] [L292] 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] [L299] 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] [L306] 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] [L312] 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] [L316] 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] [L318] 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] [L324] 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] [L329] 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] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] RET 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] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] 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] [L35] 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] [L43] 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] [L49] 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] [L54] 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] [L62] 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] [L65] 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] [L72] 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] [L80] 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] [L84] 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] [L92] 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] [L97] 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] [L102] 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] [L108] 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] [L114] 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] [L119] 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] [L124] 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] [L129] 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] [L136] 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] [L140] 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] [L144] 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] [L148] 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] [L152] 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] [L160] 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] [L165] 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] [L173] 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] [L178] 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] [L186] 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] [L189] 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] [L194] 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] [L197] 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] [L203] 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] [L208] 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] [L214] 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] [L218] 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] [L223] 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] [L231] 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] [L238] 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] [L245] 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] [L250] 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] [L256] 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] [L261] 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] [L265] 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] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] RET 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] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] 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] [L35] 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] [L43] 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] [L49] 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] [L54] 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] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] RET 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] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] 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] [L35] 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] [L43] 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] [L49] 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] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] 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=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] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) 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] [L84] 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=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] [L92] 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=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] [L97] 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=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] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) 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] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) 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] [L119] 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=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] [L124] 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=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] [L129] 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=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] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) 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] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] 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=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] [L160] 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=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] [L165] 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=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] [L173] 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=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] [L178] COND TRUE ((((((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)) [L179] a17 = 0 [L180] a16 = 5 [L181] a21 = 1 [L182] a8 = 14 [L183] a7 = 1 [L184] a20 = 1 [L185] RET return -1; VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL calculate_output(input) [L31] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] 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=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] 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=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] 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=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] 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=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((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)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L415] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L418] COND TRUE ((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L419] __VERIFIER_error() VAL [a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 369.82 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 919.0 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 104.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 919.0 MB in the beginning and 1.1 GB in the end (delta: -198.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1394.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 885.3 MB in the end (delta: 232.2 MB). Peak memory consumption was 232.2 MB. Max. memory is 11.5 GB. * CodeCheck took 70111.31 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 885.3 MB in the beginning and 1.5 GB in the end (delta: -615.1 MB). Peak memory consumption was 886.4 MB. Max. memory is 11.5 GB. * Witness Printer took 125.99 ms. Allocated memory is still 2.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...