./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label47_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d68263cf-49bd-4cca-8fad-9cd6e5c7740c/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d68263cf-49bd-4cca-8fad-9cd6e5c7740c/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d68263cf-49bd-4cca-8fad-9cd6e5c7740c/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d68263cf-49bd-4cca-8fad-9cd6e5c7740c/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label47_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d68263cf-49bd-4cca-8fad-9cd6e5c7740c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d68263cf-49bd-4cca-8fad-9cd6e5c7740c/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 db6e7a7f3be179438223abf82c6cabe8d26d1cb7 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 16:10:32,882 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 16:10:32,883 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 16:10:32,892 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 16:10:32,892 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 16:10:32,893 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 16:10:32,894 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 16:10:32,895 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 16:10:32,896 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 16:10:32,897 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 16:10:32,897 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 16:10:32,898 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 16:10:32,898 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 16:10:32,899 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 16:10:32,900 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 16:10:32,900 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 16:10:32,901 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 16:10:32,902 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 16:10:32,904 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 16:10:32,905 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 16:10:32,906 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 16:10:32,907 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 16:10:32,908 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 16:10:32,908 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 16:10:32,909 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 16:10:32,909 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 16:10:32,910 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 16:10:32,911 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 16:10:32,911 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 16:10:32,912 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 16:10:32,912 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 16:10:32,912 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 16:10:32,913 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 16:10:32,913 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 16:10:32,913 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 16:10:32,914 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 16:10:32,914 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d68263cf-49bd-4cca-8fad-9cd6e5c7740c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-02 16:10:32,924 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 16:10:32,925 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 16:10:32,925 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 16:10:32,925 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-02 16:10:32,926 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 16:10:32,926 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 16:10:32,926 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 16:10:32,926 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 16:10:32,926 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 16:10:32,927 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 16:10:32,927 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 16:10:32,927 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 16:10:32,927 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 16:10:32,927 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 16:10:32,927 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 16:10:32,927 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 16:10:32,927 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 16:10:32,927 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 16:10:32,928 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-02 16:10:32,928 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-02 16:10:32,928 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 16:10:32,928 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 16:10:32,928 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-02 16:10:32,928 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 16:10:32,928 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 16:10:32,928 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 16:10:32,929 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-02 16:10:32,929 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 16:10:32,929 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 16:10:32,929 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_d68263cf-49bd-4cca-8fad-9cd6e5c7740c/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 -> db6e7a7f3be179438223abf82c6cabe8d26d1cb7 [2018-12-02 16:10:32,951 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 16:10:32,960 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 16:10:32,963 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 16:10:32,964 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 16:10:32,964 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 16:10:32,965 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d68263cf-49bd-4cca-8fad-9cd6e5c7740c/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label47_false-unreach-call_false-termination.c [2018-12-02 16:10:33,000 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d68263cf-49bd-4cca-8fad-9cd6e5c7740c/bin-2019/ukojak/data/9516bcab1/c5fbcda5df7540fcb6258471809a67de/FLAG61deca901 [2018-12-02 16:10:33,430 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 16:10:33,430 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d68263cf-49bd-4cca-8fad-9cd6e5c7740c/sv-benchmarks/c/eca-rers2012/Problem01_label47_false-unreach-call_false-termination.c [2018-12-02 16:10:33,437 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d68263cf-49bd-4cca-8fad-9cd6e5c7740c/bin-2019/ukojak/data/9516bcab1/c5fbcda5df7540fcb6258471809a67de/FLAG61deca901 [2018-12-02 16:10:33,445 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d68263cf-49bd-4cca-8fad-9cd6e5c7740c/bin-2019/ukojak/data/9516bcab1/c5fbcda5df7540fcb6258471809a67de [2018-12-02 16:10:33,447 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 16:10:33,448 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 16:10:33,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 16:10:33,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 16:10:33,451 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 16:10:33,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:10:33" (1/1) ... [2018-12-02 16:10:33,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba821c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:10:33, skipping insertion in model container [2018-12-02 16:10:33,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:10:33" (1/1) ... [2018-12-02 16:10:33,457 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 16:10:33,482 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 16:10:33,660 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 16:10:33,663 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 16:10:33,750 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 16:10:33,760 INFO L195 MainTranslator]: Completed translation [2018-12-02 16:10:33,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:10:33 WrapperNode [2018-12-02 16:10:33,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 16:10:33,761 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 16:10:33,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 16:10:33,761 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 16:10:33,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:10:33" (1/1) ... [2018-12-02 16:10:33,775 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:10:33" (1/1) ... [2018-12-02 16:10:33,803 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 16:10:33,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 16:10:33,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 16:10:33,803 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 16:10:33,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:10:33" (1/1) ... [2018-12-02 16:10:33,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:10:33" (1/1) ... [2018-12-02 16:10:33,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:10:33" (1/1) ... [2018-12-02 16:10:33,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:10:33" (1/1) ... [2018-12-02 16:10:33,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:10:33" (1/1) ... [2018-12-02 16:10:33,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:10:33" (1/1) ... [2018-12-02 16:10:33,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:10:33" (1/1) ... [2018-12-02 16:10:33,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 16:10:33,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 16:10:33,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 16:10:33,833 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 16:10:33,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:10:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d68263cf-49bd-4cca-8fad-9cd6e5c7740c/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-12-02 16:10:33,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 16:10:33,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 16:10:34,936 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 16:10:34,936 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-02 16:10:34,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:10:34 BoogieIcfgContainer [2018-12-02 16:10:34,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 16:10:34,937 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-02 16:10:34,937 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-02 16:10:34,947 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-02 16:10:34,947 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:10:34" (1/1) ... [2018-12-02 16:10:34,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 16:10:34,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:34,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2018-12-02 16:10:34,990 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2018-12-02 16:10:34,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 16:10:34,994 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:35,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:35,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 145 states and 239 transitions. [2018-12-02 16:10:35,506 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 239 transitions. [2018-12-02 16:10:35,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 16:10:35,508 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:35,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:35,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:35,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 146 states and 240 transitions. [2018-12-02 16:10:35,709 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 240 transitions. [2018-12-02 16:10:35,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 16:10:35,710 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:35,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:35,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:35,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 150 states and 247 transitions. [2018-12-02 16:10:35,815 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 247 transitions. [2018-12-02 16:10:35,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 16:10:35,816 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:35,856 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:35,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:35,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 151 states and 249 transitions. [2018-12-02 16:10:35,892 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 249 transitions. [2018-12-02 16:10:35,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 16:10:35,896 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:35,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:36,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:36,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 221 states and 323 transitions. [2018-12-02 16:10:36,326 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 323 transitions. [2018-12-02 16:10:36,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-02 16:10:36,327 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:36,353 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 228 states and 337 transitions. [2018-12-02 16:10:36,585 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 337 transitions. [2018-12-02 16:10:36,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 16:10:36,586 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:36,598 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 16:10:36,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:36,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 229 states and 338 transitions. [2018-12-02 16:10:36,632 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 338 transitions. [2018-12-02 16:10:36,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 16:10:36,632 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:36,650 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:36,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 232 states and 343 transitions. [2018-12-02 16:10:36,696 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 343 transitions. [2018-12-02 16:10:36,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 16:10:36,697 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:36,749 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:37,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:37,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 240 states and 359 transitions. [2018-12-02 16:10:37,152 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 359 transitions. [2018-12-02 16:10:37,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 16:10:37,152 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:37,179 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 16:10:37,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:37,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 245 states and 368 transitions. [2018-12-02 16:10:37,293 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 368 transitions. [2018-12-02 16:10:37,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 16:10:37,294 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:37,325 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:37,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:37,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 248 states and 371 transitions. [2018-12-02 16:10:37,469 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 371 transitions. [2018-12-02 16:10:37,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 16:10:37,469 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:37,480 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:37,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:37,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 253 states and 377 transitions. [2018-12-02 16:10:37,505 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 377 transitions. [2018-12-02 16:10:37,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-02 16:10:37,506 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:37,523 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 16:10:37,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 259 states and 386 transitions. [2018-12-02 16:10:37,684 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 386 transitions. [2018-12-02 16:10:37,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-02 16:10:37,684 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:37,698 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 16:10:37,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:37,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 262 states and 389 transitions. [2018-12-02 16:10:37,801 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 389 transitions. [2018-12-02 16:10:37,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-02 16:10:37,802 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:37,871 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:38,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:38,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 276 states and 411 transitions. [2018-12-02 16:10:38,442 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 411 transitions. [2018-12-02 16:10:38,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 16:10:38,443 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:38,454 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:38,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:38,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 280 states and 418 transitions. [2018-12-02 16:10:38,605 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 418 transitions. [2018-12-02 16:10:38,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-02 16:10:38,606 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:38,619 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 16:10:38,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:38,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 281 states and 419 transitions. [2018-12-02 16:10:38,680 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 419 transitions. [2018-12-02 16:10:38,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-02 16:10:38,680 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:38,722 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:39,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:39,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 291 states and 430 transitions. [2018-12-02 16:10:39,113 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 430 transitions. [2018-12-02 16:10:39,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 16:10:39,113 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:39,126 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 16:10:39,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:39,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 296 states and 435 transitions. [2018-12-02 16:10:39,159 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 435 transitions. [2018-12-02 16:10:39,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 16:10:39,160 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:39,172 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 16:10:39,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:39,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 297 states and 435 transitions. [2018-12-02 16:10:39,228 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 435 transitions. [2018-12-02 16:10:39,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 16:10:39,228 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:39,239 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:39,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:39,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 307 states and 446 transitions. [2018-12-02 16:10:39,641 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 446 transitions. [2018-12-02 16:10:39,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 16:10:39,642 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:40,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:40,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 325 states and 472 transitions. [2018-12-02 16:10:40,285 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 472 transitions. [2018-12-02 16:10:40,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 16:10:40,286 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:40,296 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 16:10:40,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:40,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 329 states and 479 transitions. [2018-12-02 16:10:40,405 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 479 transitions. [2018-12-02 16:10:40,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 16:10:40,405 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:40,417 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 16:10:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 336 states and 489 transitions. [2018-12-02 16:10:40,561 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 489 transitions. [2018-12-02 16:10:40,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 16:10:40,562 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 16:10:40,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:40,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 338 states and 490 transitions. [2018-12-02 16:10:40,638 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 490 transitions. [2018-12-02 16:10:40,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 16:10:40,638 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:40,649 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 16:10:40,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:40,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 339 states and 492 transitions. [2018-12-02 16:10:40,726 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 492 transitions. [2018-12-02 16:10:40,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 16:10:40,726 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:40,738 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 16:10:40,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:40,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 340 states and 494 transitions. [2018-12-02 16:10:40,915 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 494 transitions. [2018-12-02 16:10:40,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 16:10:40,915 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:40,940 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:41,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:41,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 347 states and 503 transitions. [2018-12-02 16:10:41,116 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 503 transitions. [2018-12-02 16:10:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 16:10:41,117 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 16:10:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 349 states and 505 transitions. [2018-12-02 16:10:41,225 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 505 transitions. [2018-12-02 16:10:41,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 16:10:41,226 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:41,279 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:42,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:42,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 376 states and 541 transitions. [2018-12-02 16:10:42,253 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 541 transitions. [2018-12-02 16:10:42,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 16:10:42,254 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:43,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:43,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 398 states and 577 transitions. [2018-12-02 16:10:43,224 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 577 transitions. [2018-12-02 16:10:43,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 16:10:43,224 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:43,245 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:43,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 402 states and 580 transitions. [2018-12-02 16:10:43,375 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 580 transitions. [2018-12-02 16:10:43,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 16:10:43,375 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:43,431 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:44,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 418 states and 599 transitions. [2018-12-02 16:10:44,005 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 599 transitions. [2018-12-02 16:10:44,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 16:10:44,005 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:44,017 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 16:10:44,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 425 states and 608 transitions. [2018-12-02 16:10:44,177 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 608 transitions. [2018-12-02 16:10:44,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 16:10:44,178 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:44,190 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 16:10:44,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:44,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 430 states and 613 transitions. [2018-12-02 16:10:44,215 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 613 transitions. [2018-12-02 16:10:44,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 16:10:44,215 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:44,238 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 16:10:44,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:44,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 431 states and 614 transitions. [2018-12-02 16:10:44,330 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 614 transitions. [2018-12-02 16:10:44,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 16:10:44,331 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:44,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:44,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 434 states and 617 transitions. [2018-12-02 16:10:44,450 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 617 transitions. [2018-12-02 16:10:44,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 16:10:44,451 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:44,476 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:45,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:45,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 455 states and 642 transitions. [2018-12-02 16:10:45,070 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 642 transitions. [2018-12-02 16:10:45,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 16:10:45,070 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:45,083 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:45,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:45,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 466 states and 652 transitions. [2018-12-02 16:10:45,525 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 652 transitions. [2018-12-02 16:10:45,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 16:10:45,526 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:46,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:46,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 480 states and 673 transitions. [2018-12-02 16:10:46,991 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 673 transitions. [2018-12-02 16:10:46,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 16:10:46,992 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:47,069 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:47,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:47,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 490 states and 683 transitions. [2018-12-02 16:10:47,443 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 683 transitions. [2018-12-02 16:10:47,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 16:10:47,443 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:47,456 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 16:10:47,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:47,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 497 states and 690 transitions. [2018-12-02 16:10:47,614 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 690 transitions. [2018-12-02 16:10:47,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 16:10:47,615 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:47,629 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 16:10:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 504 states and 697 transitions. [2018-12-02 16:10:47,657 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 697 transitions. [2018-12-02 16:10:47,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-02 16:10:47,657 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:47,671 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 16:10:47,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:47,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 506 states and 701 transitions. [2018-12-02 16:10:47,754 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 701 transitions. [2018-12-02 16:10:47,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-02 16:10:47,754 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 16:10:47,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:47,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 508 states and 703 transitions. [2018-12-02 16:10:47,788 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 703 transitions. [2018-12-02 16:10:47,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-02 16:10:47,788 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:47,855 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 16:10:48,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:48,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 512 states and 709 transitions. [2018-12-02 16:10:48,221 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 709 transitions. [2018-12-02 16:10:48,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-02 16:10:48,221 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:48,371 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:50,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:50,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 542 states and 747 transitions. [2018-12-02 16:10:50,519 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 747 transitions. [2018-12-02 16:10:50,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-02 16:10:50,519 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:50,540 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:51,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:51,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 556 states and 768 transitions. [2018-12-02 16:10:51,048 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 768 transitions. [2018-12-02 16:10:51,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-02 16:10:51,049 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:51,069 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:51,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:51,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 562 states and 776 transitions. [2018-12-02 16:10:51,452 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 776 transitions. [2018-12-02 16:10:51,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-02 16:10:51,453 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:51,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:51,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 569 states and 783 transitions. [2018-12-02 16:10:51,649 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 783 transitions. [2018-12-02 16:10:51,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-02 16:10:51,650 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:51,679 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:51,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 574 states and 789 transitions. [2018-12-02 16:10:51,859 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 789 transitions. [2018-12-02 16:10:51,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 16:10:51,859 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:53,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:53,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 594 states and 817 transitions. [2018-12-02 16:10:53,156 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 817 transitions. [2018-12-02 16:10:53,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 16:10:53,157 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:54,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:54,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 605 states and 827 transitions. [2018-12-02 16:10:54,135 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 827 transitions. [2018-12-02 16:10:54,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 16:10:54,136 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:54,153 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 619 states and 843 transitions. [2018-12-02 16:10:54,888 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 843 transitions. [2018-12-02 16:10:54,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 16:10:54,889 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:54,913 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:54,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 623 states and 849 transitions. [2018-12-02 16:10:54,937 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 849 transitions. [2018-12-02 16:10:54,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 16:10:54,938 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:55,007 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:55,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:55,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 628 states and 858 transitions. [2018-12-02 16:10:55,584 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 858 transitions. [2018-12-02 16:10:55,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 16:10:55,584 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:55,599 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 16:10:55,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 631 states and 861 transitions. [2018-12-02 16:10:55,830 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 861 transitions. [2018-12-02 16:10:55,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 16:10:55,830 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:55,862 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:56,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 638 states and 871 transitions. [2018-12-02 16:10:56,806 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 871 transitions. [2018-12-02 16:10:56,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 16:10:56,806 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:57,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:57,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 639 states and 873 transitions. [2018-12-02 16:10:57,039 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 873 transitions. [2018-12-02 16:10:57,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 16:10:57,039 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:57,061 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:57,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:57,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 640 states and 875 transitions. [2018-12-02 16:10:57,313 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 875 transitions. [2018-12-02 16:10:57,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 16:10:57,314 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:57,351 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:10:57,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:57,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 646 states and 883 transitions. [2018-12-02 16:10:57,903 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 883 transitions. [2018-12-02 16:10:57,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-02 16:10:57,904 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:57,918 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 16:10:58,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:10:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 655 states and 891 transitions. [2018-12-02 16:10:58,467 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 891 transitions. [2018-12-02 16:10:58,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 16:10:58,468 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:10:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:10:58,598 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:11:01,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:01,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 680 states and 932 transitions. [2018-12-02 16:11:01,671 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 932 transitions. [2018-12-02 16:11:01,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 16:11:01,672 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:01,748 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:11:04,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:04,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 692 states and 952 transitions. [2018-12-02 16:11:04,288 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 952 transitions. [2018-12-02 16:11:04,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-02 16:11:04,288 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:04,453 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 16:11:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:05,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 717 states and 978 transitions. [2018-12-02 16:11:05,026 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 978 transitions. [2018-12-02 16:11:05,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-02 16:11:05,026 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:11:06,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:06,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 728 states and 994 transitions. [2018-12-02 16:11:06,184 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 994 transitions. [2018-12-02 16:11:06,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-02 16:11:06,185 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:06,203 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 16:11:06,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:06,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 733 states and 999 transitions. [2018-12-02 16:11:06,443 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 999 transitions. [2018-12-02 16:11:06,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-02 16:11:06,443 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:06,458 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 16:11:06,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:06,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 735 states and 1002 transitions. [2018-12-02 16:11:06,868 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1002 transitions. [2018-12-02 16:11:06,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-02 16:11:06,868 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:06,883 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 16:11:07,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:07,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 738 states and 1004 transitions. [2018-12-02 16:11:07,682 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1004 transitions. [2018-12-02 16:11:07,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-02 16:11:07,682 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 16:11:07,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:07,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 740 states and 1005 transitions. [2018-12-02 16:11:07,830 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1005 transitions. [2018-12-02 16:11:07,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-02 16:11:07,831 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:07,845 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 16:11:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 750 states and 1016 transitions. [2018-12-02 16:11:07,878 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1016 transitions. [2018-12-02 16:11:07,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-02 16:11:07,879 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 16:11:07,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:08,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 751 states and 1017 transitions. [2018-12-02 16:11:08,000 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1017 transitions. [2018-12-02 16:11:08,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-02 16:11:08,000 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 16:11:09,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:09,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 764 states and 1039 transitions. [2018-12-02 16:11:09,074 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1039 transitions. [2018-12-02 16:11:09,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-02 16:11:09,075 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:09,392 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:11:12,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:12,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 806 states and 1083 transitions. [2018-12-02 16:11:12,314 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1083 transitions. [2018-12-02 16:11:12,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-02 16:11:12,314 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:12,480 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:11:13,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 816 states and 1103 transitions. [2018-12-02 16:11:13,437 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1103 transitions. [2018-12-02 16:11:13,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-02 16:11:13,437 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:13,456 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:11:13,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:13,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 817 states and 1103 transitions. [2018-12-02 16:11:13,603 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1103 transitions. [2018-12-02 16:11:13,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-02 16:11:13,603 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:13,621 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:11:13,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:13,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 818 states and 1104 transitions. [2018-12-02 16:11:13,870 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1104 transitions. [2018-12-02 16:11:13,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-02 16:11:13,871 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:13,886 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 16:11:14,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 828 states and 1116 transitions. [2018-12-02 16:11:14,920 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1116 transitions. [2018-12-02 16:11:14,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-02 16:11:14,921 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:14,947 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 16:11:15,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:15,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 830 states and 1118 transitions. [2018-12-02 16:11:15,356 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1118 transitions. [2018-12-02 16:11:15,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-02 16:11:15,358 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:15,393 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:11:17,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:17,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 844 states and 1140 transitions. [2018-12-02 16:11:17,591 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1140 transitions. [2018-12-02 16:11:17,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-02 16:11:17,591 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:11:18,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:18,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 847 states and 1144 transitions. [2018-12-02 16:11:18,127 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1144 transitions. [2018-12-02 16:11:18,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-02 16:11:18,128 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:18,160 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:11:18,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 849 states and 1146 transitions. [2018-12-02 16:11:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1146 transitions. [2018-12-02 16:11:18,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-02 16:11:18,681 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:18,697 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:11:18,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:18,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 854 states and 1152 transitions. [2018-12-02 16:11:18,956 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1152 transitions. [2018-12-02 16:11:18,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-02 16:11:18,957 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:18,973 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 16:11:19,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:19,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 856 states and 1155 transitions. [2018-12-02 16:11:19,090 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1155 transitions. [2018-12-02 16:11:19,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-02 16:11:19,090 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:19,114 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 16:11:19,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:19,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 857 states and 1156 transitions. [2018-12-02 16:11:19,132 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1156 transitions. [2018-12-02 16:11:19,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-02 16:11:19,133 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:19,152 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 16:11:22,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 895 states and 1201 transitions. [2018-12-02 16:11:22,607 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1201 transitions. [2018-12-02 16:11:22,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-02 16:11:22,607 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 16:11:24,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:24,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 908 states and 1213 transitions. [2018-12-02 16:11:24,169 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1213 transitions. [2018-12-02 16:11:24,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-02 16:11:24,170 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:24,198 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 16:11:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 952 states and 1259 transitions. [2018-12-02 16:11:25,535 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1259 transitions. [2018-12-02 16:11:25,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-02 16:11:25,537 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:25,564 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 16:11:25,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:25,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 953 states and 1259 transitions. [2018-12-02 16:11:25,697 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1259 transitions. [2018-12-02 16:11:25,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-02 16:11:25,698 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:25,720 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 16:11:26,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:26,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 954 states and 1260 transitions. [2018-12-02 16:11:26,034 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1260 transitions. [2018-12-02 16:11:26,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-02 16:11:26,035 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:26,057 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 16:11:26,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:26,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 955 states and 1260 transitions. [2018-12-02 16:11:26,125 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1260 transitions. [2018-12-02 16:11:26,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-02 16:11:26,125 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:26,145 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 16:11:26,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:26,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 956 states and 1260 transitions. [2018-12-02 16:11:26,345 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1260 transitions. [2018-12-02 16:11:26,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-02 16:11:26,346 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:26,660 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 16:11:29,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:29,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 975 states and 1290 transitions. [2018-12-02 16:11:29,734 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1290 transitions. [2018-12-02 16:11:29,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-02 16:11:29,735 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:29,754 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 16:11:30,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:30,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 977 states and 1293 transitions. [2018-12-02 16:11:30,080 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1293 transitions. [2018-12-02 16:11:30,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-02 16:11:30,080 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:30,103 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 16:11:31,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:31,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 990 states and 1314 transitions. [2018-12-02 16:11:31,353 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1314 transitions. [2018-12-02 16:11:31,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-02 16:11:31,354 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:31,375 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 16:11:31,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:31,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 992 states and 1317 transitions. [2018-12-02 16:11:31,904 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1317 transitions. [2018-12-02 16:11:31,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-02 16:11:31,905 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:31,922 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 16:11:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:31,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 993 states and 1317 transitions. [2018-12-02 16:11:31,936 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1317 transitions. [2018-12-02 16:11:31,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-02 16:11:31,937 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:32,074 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:11:33,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:33,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1063 states and 1391 transitions. [2018-12-02 16:11:33,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1391 transitions. [2018-12-02 16:11:33,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-02 16:11:33,373 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:11:34,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:34,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1079 states and 1410 transitions. [2018-12-02 16:11:34,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1410 transitions. [2018-12-02 16:11:34,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-02 16:11:34,119 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:34,149 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:11:34,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:34,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1082 states and 1412 transitions. [2018-12-02 16:11:34,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1412 transitions. [2018-12-02 16:11:34,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-02 16:11:34,456 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:34,482 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:11:34,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:34,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1089 states and 1419 transitions. [2018-12-02 16:11:34,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1419 transitions. [2018-12-02 16:11:34,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-02 16:11:34,762 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 16:11:35,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:35,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1091 states and 1420 transitions. [2018-12-02 16:11:35,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1420 transitions. [2018-12-02 16:11:35,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-02 16:11:35,105 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:35,121 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 16:11:35,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:35,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1092 states and 1420 transitions. [2018-12-02 16:11:35,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1420 transitions. [2018-12-02 16:11:35,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-02 16:11:35,283 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:35,343 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 16:11:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:35,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1103 states and 1434 transitions. [2018-12-02 16:11:35,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1434 transitions. [2018-12-02 16:11:35,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-02 16:11:35,994 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:36,319 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 95 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 16:11:39,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:39,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1118 states and 1454 transitions. [2018-12-02 16:11:39,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1454 transitions. [2018-12-02 16:11:39,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-02 16:11:39,872 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:39,950 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 16:11:39,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:39,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1119 states and 1455 transitions. [2018-12-02 16:11:39,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1455 transitions. [2018-12-02 16:11:39,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-02 16:11:39,971 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:11:45,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1186 states and 1527 transitions. [2018-12-02 16:11:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1527 transitions. [2018-12-02 16:11:45,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-02 16:11:45,256 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:46,970 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:11:58,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:58,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1295 states and 1651 transitions. [2018-12-02 16:11:58,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1651 transitions. [2018-12-02 16:11:58,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-02 16:11:58,143 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:58,205 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 16:11:59,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:11:59,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1309 states and 1666 transitions. [2018-12-02 16:11:59,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1666 transitions. [2018-12-02 16:11:59,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-02 16:11:59,382 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:11:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:11:59,454 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 16:12:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:00,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1335 states and 1691 transitions. [2018-12-02 16:12:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1691 transitions. [2018-12-02 16:12:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-02 16:12:00,471 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:00,539 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 16:12:00,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:00,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1337 states and 1693 transitions. [2018-12-02 16:12:00,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1693 transitions. [2018-12-02 16:12:00,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-02 16:12:00,843 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:00,874 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-12-02 16:12:03,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:03,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1362 states and 1723 transitions. [2018-12-02 16:12:03,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1723 transitions. [2018-12-02 16:12:03,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-02 16:12:03,715 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 16:12:03,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:03,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1373 states and 1735 transitions. [2018-12-02 16:12:03,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1735 transitions. [2018-12-02 16:12:03,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-02 16:12:03,802 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 16:12:05,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1394 states and 1762 transitions. [2018-12-02 16:12:05,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1762 transitions. [2018-12-02 16:12:05,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-02 16:12:05,054 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:05,075 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 16:12:05,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1399 states and 1767 transitions. [2018-12-02 16:12:05,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1767 transitions. [2018-12-02 16:12:05,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-02 16:12:05,395 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:05,416 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 16:12:06,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:06,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1406 states and 1775 transitions. [2018-12-02 16:12:06,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1775 transitions. [2018-12-02 16:12:06,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-02 16:12:06,041 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:06,564 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 109 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 16:12:11,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:11,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1435 states and 1813 transitions. [2018-12-02 16:12:11,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1813 transitions. [2018-12-02 16:12:11,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-02 16:12:11,693 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:11,734 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 109 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 16:12:14,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:14,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1445 states and 1821 transitions. [2018-12-02 16:12:14,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1821 transitions. [2018-12-02 16:12:14,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-02 16:12:14,105 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:14,136 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 16:12:14,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:14,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1446 states and 1822 transitions. [2018-12-02 16:12:14,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1822 transitions. [2018-12-02 16:12:14,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-02 16:12:14,158 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:14,184 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 16:12:14,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:14,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1447 states and 1824 transitions. [2018-12-02 16:12:14,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1824 transitions. [2018-12-02 16:12:14,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-02 16:12:14,219 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:14,302 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-02 16:12:14,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:14,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1451 states and 1829 transitions. [2018-12-02 16:12:14,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1829 transitions. [2018-12-02 16:12:14,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-02 16:12:14,613 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:14,681 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 16:12:17,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:17,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1468 states and 1851 transitions. [2018-12-02 16:12:17,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1851 transitions. [2018-12-02 16:12:17,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-02 16:12:17,024 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:17,296 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:12:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1474 states and 1858 transitions. [2018-12-02 16:12:18,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 1858 transitions. [2018-12-02 16:12:18,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-02 16:12:18,118 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:18,166 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:12:19,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:19,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1539 states and 1922 transitions. [2018-12-02 16:12:19,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 1922 transitions. [2018-12-02 16:12:19,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-02 16:12:19,145 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:19,171 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 16:12:21,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1547 states and 1935 transitions. [2018-12-02 16:12:21,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 1935 transitions. [2018-12-02 16:12:21,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-02 16:12:21,433 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:21,466 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 16:12:23,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1553 states and 1946 transitions. [2018-12-02 16:12:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 1946 transitions. [2018-12-02 16:12:23,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-02 16:12:23,219 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:23,269 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 16:12:23,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:23,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1556 states and 1950 transitions. [2018-12-02 16:12:23,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1950 transitions. [2018-12-02 16:12:23,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-02 16:12:23,943 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:23,983 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 16:12:27,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:27,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1573 states and 1971 transitions. [2018-12-02 16:12:27,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1971 transitions. [2018-12-02 16:12:27,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-02 16:12:27,144 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:27,184 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 16:12:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1577 states and 1976 transitions. [2018-12-02 16:12:27,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 1976 transitions. [2018-12-02 16:12:27,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-02 16:12:27,419 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 16:12:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1578 states and 1976 transitions. [2018-12-02 16:12:27,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 1976 transitions. [2018-12-02 16:12:27,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-02 16:12:27,840 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:27,867 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-02 16:12:28,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:28,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1585 states and 1984 transitions. [2018-12-02 16:12:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 1984 transitions. [2018-12-02 16:12:28,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-02 16:12:28,325 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:28,671 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-02 16:12:29,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:29,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1590 states and 1991 transitions. [2018-12-02 16:12:29,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 1991 transitions. [2018-12-02 16:12:29,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-02 16:12:29,853 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:29,878 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 16:12:31,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:31,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 1600 states and 2006 transitions. [2018-12-02 16:12:31,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2006 transitions. [2018-12-02 16:12:31,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-02 16:12:31,646 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:32,394 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 98 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:12:34,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:34,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 1618 states and 2025 transitions. [2018-12-02 16:12:34,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2025 transitions. [2018-12-02 16:12:34,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-02 16:12:34,546 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:34,621 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 16:12:36,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:36,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 1634 states and 2051 transitions. [2018-12-02 16:12:36,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2051 transitions. [2018-12-02 16:12:36,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-02 16:12:36,879 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:36,921 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 16:12:39,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:39,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 1646 states and 2073 transitions. [2018-12-02 16:12:39,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2073 transitions. [2018-12-02 16:12:39,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-02 16:12:39,734 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:39,771 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 16:12:40,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:40,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 1650 states and 2077 transitions. [2018-12-02 16:12:40,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2077 transitions. [2018-12-02 16:12:40,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-02 16:12:40,669 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:40,702 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-02 16:12:40,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:40,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 1655 states and 2085 transitions. [2018-12-02 16:12:40,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2085 transitions. [2018-12-02 16:12:40,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-02 16:12:40,930 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:40,955 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-02 16:12:46,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:46,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 1674 states and 2112 transitions. [2018-12-02 16:12:46,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2112 transitions. [2018-12-02 16:12:46,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-02 16:12:46,233 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-02 16:12:46,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:46,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 1676 states and 2113 transitions. [2018-12-02 16:12:46,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2113 transitions. [2018-12-02 16:12:46,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-02 16:12:46,522 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:46,546 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-02 16:12:47,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:47,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 1681 states and 2120 transitions. [2018-12-02 16:12:47,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2120 transitions. [2018-12-02 16:12:47,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-02 16:12:47,229 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-02 16:12:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 1686 states and 2128 transitions. [2018-12-02 16:12:48,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 2128 transitions. [2018-12-02 16:12:48,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-02 16:12:48,199 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 16:12:48,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:48,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 1693 states and 2136 transitions. [2018-12-02 16:12:48,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2136 transitions. [2018-12-02 16:12:48,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-02 16:12:48,867 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:48,893 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-02 16:12:50,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:50,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 1720 states and 2166 transitions. [2018-12-02 16:12:50,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2166 transitions. [2018-12-02 16:12:50,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-02 16:12:50,811 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:50,848 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-02 16:12:54,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:54,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 1728 states and 2179 transitions. [2018-12-02 16:12:54,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2179 transitions. [2018-12-02 16:12:54,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-02 16:12:54,929 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:54,966 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-02 16:12:56,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:56,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 1730 states and 2184 transitions. [2018-12-02 16:12:56,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2184 transitions. [2018-12-02 16:12:56,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-02 16:12:56,823 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-02 16:12:58,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:58,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 1740 states and 2191 transitions. [2018-12-02 16:12:58,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2191 transitions. [2018-12-02 16:12:58,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-02 16:12:58,718 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:58,749 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-02 16:12:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:59,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 1741 states and 2192 transitions. [2018-12-02 16:12:59,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2192 transitions. [2018-12-02 16:12:59,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-02 16:12:59,073 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:59,098 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-02 16:12:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:12:59,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 1760 states and 2211 transitions. [2018-12-02 16:12:59,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2211 transitions. [2018-12-02 16:12:59,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-02 16:12:59,320 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:12:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:12:59,345 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-02 16:13:02,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:13:02,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2227 states to 1770 states and 2227 transitions. [2018-12-02 16:13:02,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2227 transitions. [2018-12-02 16:13:02,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-02 16:13:02,694 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:13:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:13:02,717 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-02 16:13:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:13:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 1773 states and 2229 transitions. [2018-12-02 16:13:03,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2229 transitions. [2018-12-02 16:13:03,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-02 16:13:03,756 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:13:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:13:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 16:13:07,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:13:07,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 1792 states and 2251 transitions. [2018-12-02 16:13:07,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2251 transitions. [2018-12-02 16:13:07,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-02 16:13:07,230 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:13:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:13:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 16:13:08,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:13:08,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 1803 states and 2265 transitions. [2018-12-02 16:13:08,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2265 transitions. [2018-12-02 16:13:08,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-02 16:13:08,834 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:13:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:13:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-12-02 16:13:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:13:10,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 1811 states and 2282 transitions. [2018-12-02 16:13:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2282 transitions. [2018-12-02 16:13:10,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-02 16:13:10,888 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:13:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:13:10,954 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-02 16:13:17,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:13:17,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 1844 states and 2322 transitions. [2018-12-02 16:13:17,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2322 transitions. [2018-12-02 16:13:17,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-02 16:13:17,933 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:13:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:13:18,051 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-12-02 16:13:19,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:13:19,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 1846 states and 2323 transitions. [2018-12-02 16:13:19,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2323 transitions. [2018-12-02 16:13:19,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-02 16:13:19,332 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:13:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:13:19,412 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-02 16:13:20,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:13:20,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 1854 states and 2332 transitions. [2018-12-02 16:13:20,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2332 transitions. [2018-12-02 16:13:20,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-02 16:13:20,715 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:13:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:13:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-02 16:13:22,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:13:22,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 1864 states and 2343 transitions. [2018-12-02 16:13:22,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2343 transitions. [2018-12-02 16:13:22,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-02 16:13:22,397 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:13:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:13:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 193 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-02 16:13:23,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:13:23,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 1869 states and 2349 transitions. [2018-12-02 16:13:23,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2349 transitions. [2018-12-02 16:13:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-02 16:13:23,005 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:13:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:13:27,155 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 16:13:32,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:13:32,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 1906 states and 2389 transitions. [2018-12-02 16:13:32,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 2389 transitions. [2018-12-02 16:13:32,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-02 16:13:32,764 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:13:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:13:32,854 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 16:13:37,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:13:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2397 states to 1914 states and 2397 transitions. [2018-12-02 16:13:37,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2397 transitions. [2018-12-02 16:13:37,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-02 16:13:37,161 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:13:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:13:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 16:13:38,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:13:38,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 1923 states and 2405 transitions. [2018-12-02 16:13:38,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2405 transitions. [2018-12-02 16:13:38,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-02 16:13:38,375 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:13:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:13:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 16:13:38,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:13:38,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2409 states to 1928 states and 2409 transitions. [2018-12-02 16:13:38,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2409 transitions. [2018-12-02 16:13:38,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-02 16:13:38,719 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:13:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:13:38,748 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-12-02 16:13:39,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:13:39,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 1956 states and 2441 transitions. [2018-12-02 16:13:39,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2441 transitions. [2018-12-02 16:13:39,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-02 16:13:39,972 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:13:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:13:40,003 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 16:13:40,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:13:40,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 1961 states and 2448 transitions. [2018-12-02 16:13:40,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2448 transitions. [2018-12-02 16:13:40,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-02 16:13:40,880 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:13:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:13:41,795 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 170 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 16:13:46,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:13:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2510 states to 2015 states and 2510 transitions. [2018-12-02 16:13:46,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2510 transitions. [2018-12-02 16:13:46,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-02 16:13:46,511 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:13:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:13:46,550 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 16:13:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:13:47,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2027 states and 2530 transitions. [2018-12-02 16:13:47,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2530 transitions. [2018-12-02 16:13:47,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-02 16:13:47,534 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:13:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:13:47,563 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 16:13:50,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:13:50,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2042 states and 2545 transitions. [2018-12-02 16:13:50,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2545 transitions. [2018-12-02 16:13:50,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-02 16:13:50,571 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:13:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:13:50,599 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 16:13:51,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:13:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2049 states and 2551 transitions. [2018-12-02 16:13:51,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 2551 transitions. [2018-12-02 16:13:51,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-02 16:13:51,474 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:13:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:13:55,920 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 16:14:06,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:14:06,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2099 states and 2606 transitions. [2018-12-02 16:14:06,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 2606 transitions. [2018-12-02 16:14:06,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-02 16:14:06,023 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:14:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:14:06,136 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 16:14:09,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:14:09,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2109 states and 2614 transitions. [2018-12-02 16:14:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 2614 transitions. [2018-12-02 16:14:09,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-02 16:14:09,458 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:14:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:14:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-12-02 16:14:13,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:14:13,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2642 states to 2132 states and 2642 transitions. [2018-12-02 16:14:13,085 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2642 transitions. [2018-12-02 16:14:13,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-02 16:14:13,086 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:14:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:14:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-02 16:14:21,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:14:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2202 states and 2717 transitions. [2018-12-02 16:14:21,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 2717 transitions. [2018-12-02 16:14:21,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-02 16:14:21,072 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:14:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:14:23,533 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 16:14:26,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:14:26,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2212 states and 2728 transitions. [2018-12-02 16:14:26,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 2728 transitions. [2018-12-02 16:14:26,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-02 16:14:26,910 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:14:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:14:27,039 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 16:14:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:14:28,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2215 states and 2732 transitions. [2018-12-02 16:14:28,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 2732 transitions. [2018-12-02 16:14:28,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-02 16:14:28,287 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:14:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:14:28,359 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 116 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-02 16:14:29,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:14:29,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2216 states and 2736 transitions. [2018-12-02 16:14:29,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 2736 transitions. [2018-12-02 16:14:29,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-02 16:14:29,556 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:14:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:14:32,055 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 16:14:36,955 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2018-12-02 16:14:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:14:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2247 states and 2772 transitions. [2018-12-02 16:14:43,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 2772 transitions. [2018-12-02 16:14:43,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-02 16:14:43,415 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:14:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:14:43,519 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 16:14:45,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:14:45,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2788 states to 2264 states and 2788 transitions. [2018-12-02 16:14:45,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2788 transitions. [2018-12-02 16:14:45,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-02 16:14:45,628 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:14:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:14:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 16:14:47,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:14:47,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2274 states and 2798 transitions. [2018-12-02 16:14:47,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 2798 transitions. [2018-12-02 16:14:47,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-02 16:14:47,752 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:14:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:14:47,852 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 16:14:48,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:14:48,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2275 states and 2799 transitions. [2018-12-02 16:14:48,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 2799 transitions. [2018-12-02 16:14:48,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-02 16:14:48,743 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:14:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:14:48,843 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 16:14:51,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:14:51,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2804 states to 2281 states and 2804 transitions. [2018-12-02 16:14:51,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 2804 transitions. [2018-12-02 16:14:51,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-02 16:14:51,719 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:14:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:14:51,819 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 16:14:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:14:52,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2283 states and 2805 transitions. [2018-12-02 16:14:52,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 2805 transitions. [2018-12-02 16:14:52,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-02 16:14:52,626 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:14:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:14:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-12-02 16:14:54,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:14:54,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2829 states to 2301 states and 2829 transitions. [2018-12-02 16:14:54,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 2829 transitions. [2018-12-02 16:14:54,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-02 16:14:54,140 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:14:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:14:54,189 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-12-02 16:15:02,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:02,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2849 states to 2318 states and 2849 transitions. [2018-12-02 16:15:02,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2849 transitions. [2018-12-02 16:15:02,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-02 16:15:02,226 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:02,265 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-12-02 16:15:03,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:03,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2321 states and 2852 transitions. [2018-12-02 16:15:03,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 2852 transitions. [2018-12-02 16:15:03,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-02 16:15:03,380 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-12-02 16:15:03,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:03,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2325 states and 2856 transitions. [2018-12-02 16:15:03,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 2856 transitions. [2018-12-02 16:15:03,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-02 16:15:03,731 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:03,774 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-12-02 16:15:04,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:04,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2326 states and 2857 transitions. [2018-12-02 16:15:04,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 2857 transitions. [2018-12-02 16:15:04,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-02 16:15:04,374 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:04,417 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-12-02 16:15:05,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:05,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2327 states and 2857 transitions. [2018-12-02 16:15:05,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 2857 transitions. [2018-12-02 16:15:05,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-02 16:15:05,446 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:05,500 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-02 16:15:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2896 states to 2367 states and 2896 transitions. [2018-12-02 16:15:10,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2896 transitions. [2018-12-02 16:15:10,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-02 16:15:10,079 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-02 16:15:11,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:11,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2913 states to 2381 states and 2913 transitions. [2018-12-02 16:15:11,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 2913 transitions. [2018-12-02 16:15:11,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-02 16:15:11,732 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-02 16:15:12,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:12,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2384 states and 2919 transitions. [2018-12-02 16:15:12,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states and 2919 transitions. [2018-12-02 16:15:12,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-02 16:15:12,445 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-02 16:15:14,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:14,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2386 states and 2922 transitions. [2018-12-02 16:15:14,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 2922 transitions. [2018-12-02 16:15:14,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-02 16:15:14,275 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:14,328 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-02 16:15:20,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:20,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2407 states and 2948 transitions. [2018-12-02 16:15:20,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2407 states and 2948 transitions. [2018-12-02 16:15:20,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-02 16:15:20,231 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:20,286 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-02 16:15:23,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:23,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2412 states and 2953 transitions. [2018-12-02 16:15:23,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 2953 transitions. [2018-12-02 16:15:23,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-02 16:15:23,283 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:23,332 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-02 16:15:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:25,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2960 states to 2419 states and 2960 transitions. [2018-12-02 16:15:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 2960 transitions. [2018-12-02 16:15:25,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-02 16:15:25,025 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:25,080 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-02 16:15:26,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:26,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2963 states to 2423 states and 2963 transitions. [2018-12-02 16:15:26,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 2963 transitions. [2018-12-02 16:15:26,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-02 16:15:26,211 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:26,260 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-02 16:15:26,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2426 states and 2965 transitions. [2018-12-02 16:15:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 2965 transitions. [2018-12-02 16:15:26,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-02 16:15:26,692 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-02 16:15:27,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:27,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2429 states and 2968 transitions. [2018-12-02 16:15:27,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 2968 transitions. [2018-12-02 16:15:27,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-02 16:15:27,892 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:27,940 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-02 16:15:28,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2969 states to 2431 states and 2969 transitions. [2018-12-02 16:15:28,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 2969 transitions. [2018-12-02 16:15:28,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-02 16:15:28,501 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:28,549 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-02 16:15:30,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:30,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2444 states and 2984 transitions. [2018-12-02 16:15:30,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 2984 transitions. [2018-12-02 16:15:30,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-02 16:15:30,640 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-02 16:15:31,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:31,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2446 states and 2985 transitions. [2018-12-02 16:15:31,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 2985 transitions. [2018-12-02 16:15:31,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-02 16:15:31,673 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:31,748 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-02 16:15:33,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:33,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2450 states and 2990 transitions. [2018-12-02 16:15:33,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 2990 transitions. [2018-12-02 16:15:33,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-02 16:15:33,072 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:33,735 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 278 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-12-02 16:15:41,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:41,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 2461 states and 3012 transitions. [2018-12-02 16:15:41,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 3012 transitions. [2018-12-02 16:15:41,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-02 16:15:41,834 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:41,923 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 250 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-02 16:15:42,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:42,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 2465 states and 3018 transitions. [2018-12-02 16:15:42,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3018 transitions. [2018-12-02 16:15:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-02 16:15:42,980 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 250 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-02 16:15:43,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:43,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 2467 states and 3022 transitions. [2018-12-02 16:15:43,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3022 transitions. [2018-12-02 16:15:43,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-02 16:15:43,849 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:43,930 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 250 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-02 16:15:44,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:44,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 2468 states and 3022 transitions. [2018-12-02 16:15:44,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 3022 transitions. [2018-12-02 16:15:44,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-12-02 16:15:44,212 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:44,249 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-02 16:15:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:45,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3032 states to 2477 states and 3032 transitions. [2018-12-02 16:15:45,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3032 transitions. [2018-12-02 16:15:45,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-12-02 16:15:45,775 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-02 16:15:46,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:46,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 2487 states and 3041 transitions. [2018-12-02 16:15:46,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 3041 transitions. [2018-12-02 16:15:46,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-12-02 16:15:46,442 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 71 proven. 187 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-02 16:15:55,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:15:55,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 2502 states and 3066 transitions. [2018-12-02 16:15:55,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 3066 transitions. [2018-12-02 16:15:55,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-12-02 16:15:55,311 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:15:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:15:55,367 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-02 16:16:02,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:16:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3103 states to 2533 states and 3103 transitions. [2018-12-02 16:16:02,792 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 3103 transitions. [2018-12-02 16:16:02,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-12-02 16:16:02,795 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:16:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:16:02,858 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-02 16:16:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:16:02,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 2537 states and 3106 transitions. [2018-12-02 16:16:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 3106 transitions. [2018-12-02 16:16:02,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-12-02 16:16:02,898 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:16:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:16:02,950 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-02 16:16:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:16:02,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 2543 states and 3111 transitions. [2018-12-02 16:16:02,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 3111 transitions. [2018-12-02 16:16:02,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-12-02 16:16:02,994 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:16:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:16:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-02 16:16:03,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:16:03,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 2544 states and 3111 transitions. [2018-12-02 16:16:03,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 3111 transitions. [2018-12-02 16:16:03,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-12-02 16:16:03,376 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:16:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:16:05,349 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-02 16:16:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:16:24,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 2592 states and 3191 transitions. [2018-12-02 16:16:24,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 3191 transitions. [2018-12-02 16:16:24,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-12-02 16:16:24,476 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:16:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:16:24,549 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-02 16:16:26,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:16:26,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3200 states to 2606 states and 3200 transitions. [2018-12-02 16:16:26,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 3200 transitions. [2018-12-02 16:16:26,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-12-02 16:16:26,947 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:16:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:16:27,021 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-02 16:16:30,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:16:30,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 2611 states and 3208 transitions. [2018-12-02 16:16:30,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 3208 transitions. [2018-12-02 16:16:30,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-02 16:16:30,144 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:16:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:16:30,241 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-12-02 16:16:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:16:41,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3295 states to 2669 states and 3295 transitions. [2018-12-02 16:16:41,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 3295 transitions. [2018-12-02 16:16:41,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-02 16:16:41,132 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:16:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:16:41,232 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-12-02 16:16:44,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:16:44,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 2694 states and 3329 transitions. [2018-12-02 16:16:44,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2694 states and 3329 transitions. [2018-12-02 16:16:44,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-02 16:16:44,327 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:16:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:16:44,436 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-12-02 16:16:44,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:16:44,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3343 states to 2709 states and 3343 transitions. [2018-12-02 16:16:44,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2709 states and 3343 transitions. [2018-12-02 16:16:44,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-02 16:16:44,552 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:16:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:16:44,660 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-12-02 16:16:47,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:16:47,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3353 states to 2719 states and 3353 transitions. [2018-12-02 16:16:47,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 3353 transitions. [2018-12-02 16:16:47,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-02 16:16:47,681 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:16:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:16:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-12-02 16:16:48,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:16:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3359 states to 2723 states and 3359 transitions. [2018-12-02 16:16:48,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3359 transitions. [2018-12-02 16:16:48,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-02 16:16:48,489 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:16:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:16:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-12-02 16:16:52,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:16:52,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3373 states to 2733 states and 3373 transitions. [2018-12-02 16:16:52,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2733 states and 3373 transitions. [2018-12-02 16:16:52,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-02 16:16:52,563 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:16:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:16:52,679 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-12-02 16:16:53,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:16:53,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3373 states to 2734 states and 3373 transitions. [2018-12-02 16:16:53,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2734 states and 3373 transitions. [2018-12-02 16:16:53,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-02 16:16:53,314 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:16:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:16:53,410 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-12-02 16:16:54,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:16:54,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 2738 states and 3377 transitions. [2018-12-02 16:16:54,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 3377 transitions. [2018-12-02 16:16:54,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-02 16:16:54,037 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:16:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:16:54,145 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-12-02 16:16:55,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:16:55,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3389 states to 2744 states and 3389 transitions. [2018-12-02 16:16:55,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 3389 transitions. [2018-12-02 16:16:55,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-12-02 16:16:55,647 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:16:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:17:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-02 16:17:06,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:17:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3411 states to 2764 states and 3411 transitions. [2018-12-02 16:17:06,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3411 transitions. [2018-12-02 16:17:06,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-12-02 16:17:06,119 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:17:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:17:10,061 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 375 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-02 16:17:22,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:17:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3458 states to 2796 states and 3458 transitions. [2018-12-02 16:17:22,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2796 states and 3458 transitions. [2018-12-02 16:17:22,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-02 16:17:22,545 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:17:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:17:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-02 16:17:24,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:17:24,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 2811 states and 3472 transitions. [2018-12-02 16:17:24,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2811 states and 3472 transitions. [2018-12-02 16:17:24,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-02 16:17:24,180 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:17:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:17:24,231 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-02 16:17:26,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:17:26,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 2831 states and 3494 transitions. [2018-12-02 16:17:26,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 3494 transitions. [2018-12-02 16:17:26,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-02 16:17:26,269 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:17:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:17:26,320 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-02 16:17:27,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:17:27,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3499 states to 2836 states and 3499 transitions. [2018-12-02 16:17:27,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2836 states and 3499 transitions. [2018-12-02 16:17:27,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-02 16:17:27,745 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:17:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:17:27,797 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-02 16:17:31,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:17:31,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3513 states to 2851 states and 3513 transitions. [2018-12-02 16:17:31,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 3513 transitions. [2018-12-02 16:17:31,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-02 16:17:31,814 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:17:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:17:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-02 16:17:33,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:17:33,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 2853 states and 3514 transitions. [2018-12-02 16:17:33,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 3514 transitions. [2018-12-02 16:17:33,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-02 16:17:33,554 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:17:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:17:33,606 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-02 16:17:34,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:17:34,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 2863 states and 3525 transitions. [2018-12-02 16:17:34,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2863 states and 3525 transitions. [2018-12-02 16:17:34,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-02 16:17:34,665 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:17:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:17:34,716 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-02 16:17:35,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:17:35,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 2865 states and 3526 transitions. [2018-12-02 16:17:35,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 3526 transitions. [2018-12-02 16:17:35,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-12-02 16:17:35,398 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:17:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:17:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-02 16:17:40,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:17:40,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3541 states to 2871 states and 3541 transitions. [2018-12-02 16:17:40,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 3541 transitions. [2018-12-02 16:17:40,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-12-02 16:17:40,286 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:17:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:17:40,339 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-12-02 16:17:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:17:47,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 2897 states and 3572 transitions. [2018-12-02 16:17:47,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 3572 transitions. [2018-12-02 16:17:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-12-02 16:17:47,395 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:17:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:17:47,450 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-12-02 16:17:52,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:17:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3587 states to 2909 states and 3587 transitions. [2018-12-02 16:17:52,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2909 states and 3587 transitions. [2018-12-02 16:17:52,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-12-02 16:17:52,884 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:17:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:17:52,940 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-12-02 16:17:56,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:17:56,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3599 states to 2922 states and 3599 transitions. [2018-12-02 16:17:56,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 3599 transitions. [2018-12-02 16:17:56,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-12-02 16:17:56,526 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:17:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:17:56,578 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-12-02 16:17:58,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:17:58,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3599 states to 2924 states and 3599 transitions. [2018-12-02 16:17:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 3599 transitions. [2018-12-02 16:17:58,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-12-02 16:17:58,167 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:17:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:17:58,221 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-12-02 16:17:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:17:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3599 states to 2925 states and 3599 transitions. [2018-12-02 16:17:58,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2925 states and 3599 transitions. [2018-12-02 16:17:58,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-12-02 16:17:58,743 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:17:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:17:58,794 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-12-02 16:17:59,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:17:59,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3605 states to 2932 states and 3605 transitions. [2018-12-02 16:17:59,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2932 states and 3605 transitions. [2018-12-02 16:17:59,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-12-02 16:17:59,557 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:17:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:17:59,664 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-12-02 16:18:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:18:12,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3675 states to 2991 states and 3675 transitions. [2018-12-02 16:18:12,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2991 states and 3675 transitions. [2018-12-02 16:18:12,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-12-02 16:18:12,973 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:18:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:18:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-12-02 16:18:17,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:18:17,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3718 states to 3030 states and 3718 transitions. [2018-12-02 16:18:17,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3718 transitions. [2018-12-02 16:18:17,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-12-02 16:18:17,793 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:18:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:18:17,895 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-12-02 16:18:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:18:20,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3728 states to 3043 states and 3728 transitions. [2018-12-02 16:18:20,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 3728 transitions. [2018-12-02 16:18:20,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-12-02 16:18:20,641 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:18:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 16:18:20,757 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-12-02 16:18:21,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 16:18:21,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3048 states and 3734 transitions. [2018-12-02 16:18:21,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 3734 transitions. [2018-12-02 16:18:21,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-12-02 16:18:21,707 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 16:18:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 16:18:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 16:18:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 16:18:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 16:18:21,926 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 246 iterations. [2018-12-02 16:18:22,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 04:18:22 ImpRootNode [2018-12-02 16:18:22,051 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-02 16:18:22,051 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 16:18:22,052 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 16:18:22,052 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 16:18:22,052 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:10:34" (3/4) ... [2018-12-02 16:18:22,054 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 16:18:22,140 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d68263cf-49bd-4cca-8fad-9cd6e5c7740c/bin-2019/ukojak/witness.graphml [2018-12-02 16:18:22,140 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 16:18:22,141 INFO L168 Benchmark]: Toolchain (without parser) took 468693.05 ms. Allocated memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: 2.7 GB). Free memory was 950.6 MB in the beginning and 323.6 MB in the end (delta: 627.0 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2018-12-02 16:18:22,141 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 16:18:22,141 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -174.8 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. [2018-12-02 16:18:22,141 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-02 16:18:22,141 INFO L168 Benchmark]: Boogie Preprocessor took 29.72 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-12-02 16:18:22,141 INFO L168 Benchmark]: RCFGBuilder took 1103.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 901.5 MB in the end (delta: 210.2 MB). Peak memory consumption was 210.2 MB. Max. memory is 11.5 GB. [2018-12-02 16:18:22,142 INFO L168 Benchmark]: CodeCheck took 467113.78 ms. Allocated memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: 2.6 GB). Free memory was 901.5 MB in the beginning and 374.9 MB in the end (delta: 526.6 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2018-12-02 16:18:22,142 INFO L168 Benchmark]: Witness Printer took 88.64 ms. Allocated memory is still 3.8 GB. Free memory was 374.9 MB in the beginning and 323.6 MB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. [2018-12-02 16:18:22,143 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, 198 locations, 1 error locations. UNSAFE Result, 466.9s OverallTime, 246 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1825575020 SDtfs, 918232036 SDslu, -1931445592 SDs, 0 SdLazy, -557301158 SolverSat, 839387186 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1242.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 266676 GetRequests, 259637 SyntacticMatches, 4331 SemanticMatches, 2708 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5116411 ImplicationChecksByTransitivity, 435.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.8s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 38.0s InterpolantComputationTime, 39497 NumberOfCodeBlocks, 39497 NumberOfCodeBlocksAsserted, 246 NumberOfCheckSat, 38990 ConstructedInterpolants, 0 QuantifiedInterpolants, 26961347 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 245 InterpolantComputations, 203 PerfectInterpolantSequences, 35478/35924 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: 395]: 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)) [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] 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] 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)) [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] 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] 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)) [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] 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] 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)) [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 TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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)) [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND TRUE ((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))) [L149] a16 = 4 [L150] a17 = 0 [L151] return 25; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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)) [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND TRUE ((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1))) [L232] a8 = 14 [L233] a7 = 0 [L234] a17 = 1 [L235] a21 = 1 [L236] a16 = 4 [L237] return -1; VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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] 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)) [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=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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=4, a17=1, a20=1, a21=1, a7=0, 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))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND TRUE (((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L395] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 312.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -174.8 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.72 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 1103.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 901.5 MB in the end (delta: 210.2 MB). Peak memory consumption was 210.2 MB. Max. memory is 11.5 GB. * CodeCheck took 467113.78 ms. Allocated memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: 2.6 GB). Free memory was 901.5 MB in the beginning and 374.9 MB in the end (delta: 526.6 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. * Witness Printer took 88.64 ms. Allocated memory is still 3.8 GB. Free memory was 374.9 MB in the beginning and 323.6 MB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...