./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label44_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2ba48691-2ff6-459c-8d08-3439245506e0/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2ba48691-2ff6-459c-8d08-3439245506e0/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2ba48691-2ff6-459c-8d08-3439245506e0/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2ba48691-2ff6-459c-8d08-3439245506e0/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label44_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2ba48691-2ff6-459c-8d08-3439245506e0/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2ba48691-2ff6-459c-8d08-3439245506e0/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 2239efb232e6960cd140d60028ed9446da6b2730 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 13:33:47,825 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:33:47,827 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:33:47,836 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:33:47,836 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:33:47,837 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:33:47,838 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:33:47,839 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:33:47,840 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:33:47,841 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:33:47,842 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:33:47,842 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:33:47,843 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:33:47,844 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:33:47,844 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:33:47,845 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:33:47,846 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:33:47,847 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:33:47,848 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:33:47,850 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:33:47,851 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:33:47,852 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:33:47,854 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:33:47,854 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:33:47,854 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:33:47,855 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:33:47,856 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:33:47,856 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:33:47,857 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:33:47,858 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:33:47,858 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:33:47,859 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:33:47,859 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:33:47,860 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:33:47,860 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:33:47,861 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:33:47,861 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2ba48691-2ff6-459c-8d08-3439245506e0/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-18 13:33:47,871 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:33:47,872 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:33:47,872 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 13:33:47,872 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 13:33:47,873 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:33:47,873 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:33:47,873 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:33:47,873 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:33:47,873 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:33:47,874 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:33:47,874 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:33:47,874 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 13:33:47,874 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 13:33:47,874 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 13:33:47,874 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:33:47,874 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:33:47,874 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:33:47,874 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 13:33:47,875 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-18 13:33:47,875 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-18 13:33:47,875 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:33:47,875 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 13:33:47,875 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 13:33:47,875 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:33:47,875 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 13:33:47,875 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 13:33:47,875 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-18 13:33:47,876 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 13:33:47,876 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 13:33:47,876 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_2ba48691-2ff6-459c-8d08-3439245506e0/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 -> 2239efb232e6960cd140d60028ed9446da6b2730 [2018-11-18 13:33:47,900 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:33:47,908 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:33:47,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:33:47,912 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:33:47,912 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:33:47,913 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2ba48691-2ff6-459c-8d08-3439245506e0/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label44_false-unreach-call_false-termination.c [2018-11-18 13:33:47,950 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2ba48691-2ff6-459c-8d08-3439245506e0/bin-2019/ukojak/data/e1dd7f05d/7bea5304aae54749a6d5453be8bad27f/FLAG89a8d2458 [2018-11-18 13:33:48,308 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:33:48,308 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2ba48691-2ff6-459c-8d08-3439245506e0/sv-benchmarks/c/eca-rers2012/Problem01_label44_false-unreach-call_false-termination.c [2018-11-18 13:33:48,317 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2ba48691-2ff6-459c-8d08-3439245506e0/bin-2019/ukojak/data/e1dd7f05d/7bea5304aae54749a6d5453be8bad27f/FLAG89a8d2458 [2018-11-18 13:33:48,329 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2ba48691-2ff6-459c-8d08-3439245506e0/bin-2019/ukojak/data/e1dd7f05d/7bea5304aae54749a6d5453be8bad27f [2018-11-18 13:33:48,332 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:33:48,333 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:33:48,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:33:48,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:33:48,337 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:33:48,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:33:48" (1/1) ... [2018-11-18 13:33:48,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d4950b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:33:48, skipping insertion in model container [2018-11-18 13:33:48,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:33:48" (1/1) ... [2018-11-18 13:33:48,347 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:33:48,381 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:33:48,626 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:33:48,630 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:33:48,696 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:33:48,710 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:33:48,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:33:48 WrapperNode [2018-11-18 13:33:48,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:33:48,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:33:48,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:33:48,711 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:33:48,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:33:48" (1/1) ... [2018-11-18 13:33:48,783 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:33:48" (1/1) ... [2018-11-18 13:33:48,817 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:33:48,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:33:48,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:33:48,818 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:33:48,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:33:48" (1/1) ... [2018-11-18 13:33:48,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:33:48" (1/1) ... [2018-11-18 13:33:48,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:33:48" (1/1) ... [2018-11-18 13:33:48,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:33:48" (1/1) ... [2018-11-18 13:33:48,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:33:48" (1/1) ... [2018-11-18 13:33:48,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:33:48" (1/1) ... [2018-11-18 13:33:48,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:33:48" (1/1) ... [2018-11-18 13:33:48,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:33:48,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:33:48,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:33:48,865 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:33:48,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:33:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2ba48691-2ff6-459c-8d08-3439245506e0/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 13:33:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 13:33:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:33:48,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:33:50,512 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:33:50,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:33:50 BoogieIcfgContainer [2018-11-18 13:33:50,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:33:50,513 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-18 13:33:50,513 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-18 13:33:50,521 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-18 13:33:50,521 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:33:50" (1/1) ... [2018-11-18 13:33:50,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:33:50,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:50,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-11-18 13:33:50,555 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-11-18 13:33:50,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 13:33:50,558 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:50,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:33:51,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 147 states and 239 transitions. [2018-11-18 13:33:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 239 transitions. [2018-11-18 13:33:51,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 13:33:51,160 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:51,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 13:33:51,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:51,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 148 states and 240 transitions. [2018-11-18 13:33:51,418 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 240 transitions. [2018-11-18 13:33:51,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-18 13:33:51,420 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:51,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:33:51,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:51,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 153 states and 248 transitions. [2018-11-18 13:33:51,569 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 248 transitions. [2018-11-18 13:33:51,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 13:33:51,570 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:51,633 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:33:51,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 162 states and 264 transitions. [2018-11-18 13:33:51,830 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 264 transitions. [2018-11-18 13:33:51,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 13:33:51,832 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:51,854 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 13:33:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 163 states and 265 transitions. [2018-11-18 13:33:51,956 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 265 transitions. [2018-11-18 13:33:51,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-18 13:33:51,958 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:52,024 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 13:33:52,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:52,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 176 states and 286 transitions. [2018-11-18 13:33:52,321 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 286 transitions. [2018-11-18 13:33:52,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-18 13:33:52,325 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:33:52,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:52,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 182 states and 293 transitions. [2018-11-18 13:33:52,507 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 293 transitions. [2018-11-18 13:33:52,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-18 13:33:52,508 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:52,539 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:33:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:52,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 183 states and 294 transitions. [2018-11-18 13:33:52,572 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 294 transitions. [2018-11-18 13:33:52,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-18 13:33:52,573 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:52,669 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:33:53,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 198 states and 314 transitions. [2018-11-18 13:33:53,100 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 314 transitions. [2018-11-18 13:33:53,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-18 13:33:53,101 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:53,124 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:33:53,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:53,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 199 states and 316 transitions. [2018-11-18 13:33:53,146 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 316 transitions. [2018-11-18 13:33:53,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-18 13:33:53,147 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:53,200 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:33:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:53,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 209 states and 335 transitions. [2018-11-18 13:33:53,508 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 335 transitions. [2018-11-18 13:33:53,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-18 13:33:53,509 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:53,529 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:33:53,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:53,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 210 states and 337 transitions. [2018-11-18 13:33:53,628 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 337 transitions. [2018-11-18 13:33:53,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-18 13:33:53,629 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:53,654 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 13:33:53,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:53,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 211 states and 338 transitions. [2018-11-18 13:33:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 338 transitions. [2018-11-18 13:33:53,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-18 13:33:53,688 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:33:53,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:53,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 214 states and 341 transitions. [2018-11-18 13:33:53,728 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 341 transitions. [2018-11-18 13:33:53,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 13:33:53,729 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:33:54,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 225 states and 359 transitions. [2018-11-18 13:33:54,456 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 359 transitions. [2018-11-18 13:33:54,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 13:33:54,457 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:54,492 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 13:33:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 227 states and 360 transitions. [2018-11-18 13:33:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 360 transitions. [2018-11-18 13:33:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 13:33:54,605 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:54,629 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 13:33:54,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:54,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 231 states and 364 transitions. [2018-11-18 13:33:54,792 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 364 transitions. [2018-11-18 13:33:54,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 13:33:54,793 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:54,816 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 13:33:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 232 states and 365 transitions. [2018-11-18 13:33:54,955 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 365 transitions. [2018-11-18 13:33:54,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 13:33:54,956 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:33:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 238 states and 375 transitions. [2018-11-18 13:33:55,276 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 375 transitions. [2018-11-18 13:33:55,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-18 13:33:55,277 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:55,295 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:33:55,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:55,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 248 states and 389 transitions. [2018-11-18 13:33:55,593 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 389 transitions. [2018-11-18 13:33:55,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-18 13:33:55,593 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:55,608 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:33:55,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:55,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 249 states and 391 transitions. [2018-11-18 13:33:55,761 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 391 transitions. [2018-11-18 13:33:55,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-18 13:33:55,761 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:55,775 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 13:33:55,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 251 states and 392 transitions. [2018-11-18 13:33:55,869 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 392 transitions. [2018-11-18 13:33:55,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-18 13:33:55,870 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:55,947 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:33:56,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:56,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 276 states and 426 transitions. [2018-11-18 13:33:56,813 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 426 transitions. [2018-11-18 13:33:56,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-18 13:33:56,814 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:56,830 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 13:33:57,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:57,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 287 states and 440 transitions. [2018-11-18 13:33:57,275 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 440 transitions. [2018-11-18 13:33:57,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-18 13:33:57,276 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:57,374 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:33:57,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:57,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 290 states and 443 transitions. [2018-11-18 13:33:57,424 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 443 transitions. [2018-11-18 13:33:57,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 13:33:57,425 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:57,440 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 13:33:57,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:57,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 292 states and 448 transitions. [2018-11-18 13:33:57,560 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 448 transitions. [2018-11-18 13:33:57,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 13:33:57,560 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:57,650 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:33:58,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:58,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 306 states and 470 transitions. [2018-11-18 13:33:58,474 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 470 transitions. [2018-11-18 13:33:58,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 13:33:58,475 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:58,492 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:33:58,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:58,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 311 states and 477 transitions. [2018-11-18 13:33:58,724 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 477 transitions. [2018-11-18 13:33:58,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 13:33:58,725 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:58,741 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:33:59,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:33:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 326 states and 492 transitions. [2018-11-18 13:33:59,394 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 492 transitions. [2018-11-18 13:33:59,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 13:33:59,394 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:33:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:33:59,458 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:00,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:00,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 337 states and 504 transitions. [2018-11-18 13:34:00,103 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 504 transitions. [2018-11-18 13:34:00,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-18 13:34:00,104 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:00,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:00,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 339 states and 507 transitions. [2018-11-18 13:34:00,186 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 507 transitions. [2018-11-18 13:34:00,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 13:34:00,187 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:02,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:02,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 365 states and 548 transitions. [2018-11-18 13:34:02,080 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 548 transitions. [2018-11-18 13:34:02,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 13:34:02,081 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:02,202 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:02,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:02,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 366 states and 550 transitions. [2018-11-18 13:34:02,384 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 550 transitions. [2018-11-18 13:34:02,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 13:34:02,385 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:02,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:02,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 377 states and 563 transitions. [2018-11-18 13:34:02,937 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 563 transitions. [2018-11-18 13:34:02,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 13:34:02,937 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:03,041 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:03,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:03,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 383 states and 569 transitions. [2018-11-18 13:34:03,219 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 569 transitions. [2018-11-18 13:34:03,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 13:34:03,220 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:03,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:03,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 384 states and 570 transitions. [2018-11-18 13:34:03,454 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 570 transitions. [2018-11-18 13:34:03,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 13:34:03,455 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:03,544 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 388 states and 574 transitions. [2018-11-18 13:34:03,748 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 574 transitions. [2018-11-18 13:34:03,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 13:34:03,749 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:04,043 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:05,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:05,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 402 states and 595 transitions. [2018-11-18 13:34:05,152 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 595 transitions. [2018-11-18 13:34:05,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 13:34:05,152 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:05,169 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 13:34:05,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:05,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 413 states and 608 transitions. [2018-11-18 13:34:05,923 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 608 transitions. [2018-11-18 13:34:05,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 13:34:05,924 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:05,938 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 13:34:06,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:06,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 420 states and 617 transitions. [2018-11-18 13:34:06,306 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 617 transitions. [2018-11-18 13:34:06,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 13:34:06,307 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:06,323 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 13:34:06,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 422 states and 618 transitions. [2018-11-18 13:34:06,565 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 618 transitions. [2018-11-18 13:34:06,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 13:34:06,565 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:06,594 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:07,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:07,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 439 states and 639 transitions. [2018-11-18 13:34:07,610 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 639 transitions. [2018-11-18 13:34:07,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 13:34:07,610 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:08,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:08,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 454 states and 664 transitions. [2018-11-18 13:34:08,823 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 664 transitions. [2018-11-18 13:34:08,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 13:34:08,823 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:08,853 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:09,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:09,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 458 states and 668 transitions. [2018-11-18 13:34:09,021 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 668 transitions. [2018-11-18 13:34:09,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 13:34:09,021 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:09,046 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:09,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 466 states and 675 transitions. [2018-11-18 13:34:09,271 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 675 transitions. [2018-11-18 13:34:09,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 13:34:09,272 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:09,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:09,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 476 states and 684 transitions. [2018-11-18 13:34:09,540 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 684 transitions. [2018-11-18 13:34:09,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 13:34:09,540 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:09,604 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:10,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:10,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 547 states and 764 transitions. [2018-11-18 13:34:10,010 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 764 transitions. [2018-11-18 13:34:10,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-18 13:34:10,010 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:10,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 548 states and 765 transitions. [2018-11-18 13:34:10,427 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 765 transitions. [2018-11-18 13:34:10,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-18 13:34:10,428 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:10,445 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:10,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:10,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 555 states and 772 transitions. [2018-11-18 13:34:10,664 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 772 transitions. [2018-11-18 13:34:10,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-18 13:34:10,664 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:10,683 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:10,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 556 states and 772 transitions. [2018-11-18 13:34:10,908 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 772 transitions. [2018-11-18 13:34:10,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-18 13:34:10,909 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:10,923 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 565 states and 783 transitions. [2018-11-18 13:34:10,953 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 783 transitions. [2018-11-18 13:34:10,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-18 13:34:10,953 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:10,968 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:11,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 580 states and 803 transitions. [2018-11-18 13:34:11,770 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 803 transitions. [2018-11-18 13:34:11,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-18 13:34:11,771 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:12,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 585 states and 807 transitions. [2018-11-18 13:34:12,210 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 807 transitions. [2018-11-18 13:34:12,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-18 13:34:12,211 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:12,225 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:12,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:12,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 586 states and 807 transitions. [2018-11-18 13:34:12,323 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 807 transitions. [2018-11-18 13:34:12,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-18 13:34:12,324 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:12,361 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:12,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 599 states and 822 transitions. [2018-11-18 13:34:12,586 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 822 transitions. [2018-11-18 13:34:12,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-18 13:34:12,587 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:12,603 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 13:34:12,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:12,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 601 states and 823 transitions. [2018-11-18 13:34:12,695 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 823 transitions. [2018-11-18 13:34:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-18 13:34:12,695 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:12,711 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:12,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 605 states and 826 transitions. [2018-11-18 13:34:12,831 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 826 transitions. [2018-11-18 13:34:12,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-18 13:34:12,832 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:12,913 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:13,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:13,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 619 states and 842 transitions. [2018-11-18 13:34:13,111 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 842 transitions. [2018-11-18 13:34:13,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-18 13:34:13,112 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:13,127 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 13:34:13,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:13,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 621 states and 843 transitions. [2018-11-18 13:34:13,231 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 843 transitions. [2018-11-18 13:34:13,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 13:34:13,231 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:13,250 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 13:34:13,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:13,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 623 states and 846 transitions. [2018-11-18 13:34:13,269 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 846 transitions. [2018-11-18 13:34:13,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 13:34:13,270 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:13,648 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 668 states and 894 transitions. [2018-11-18 13:34:15,488 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 894 transitions. [2018-11-18 13:34:15,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 13:34:15,489 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:16,087 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 45 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:18,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:18,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 758 states and 998 transitions. [2018-11-18 13:34:18,872 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 998 transitions. [2018-11-18 13:34:18,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 13:34:18,873 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:19,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:19,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 772 states and 1017 transitions. [2018-11-18 13:34:19,423 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1017 transitions. [2018-11-18 13:34:19,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 13:34:19,424 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:20,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:20,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 780 states and 1027 transitions. [2018-11-18 13:34:20,101 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1027 transitions. [2018-11-18 13:34:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 13:34:20,102 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:20,127 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:20,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:20,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 785 states and 1031 transitions. [2018-11-18 13:34:20,305 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1031 transitions. [2018-11-18 13:34:20,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 13:34:20,306 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 13:34:21,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 799 states and 1061 transitions. [2018-11-18 13:34:21,351 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1061 transitions. [2018-11-18 13:34:21,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 13:34:21,352 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:21,414 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 13:34:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 804 states and 1072 transitions. [2018-11-18 13:34:21,809 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1072 transitions. [2018-11-18 13:34:21,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 13:34:21,810 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:21,870 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 13:34:22,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 809 states and 1080 transitions. [2018-11-18 13:34:22,258 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1080 transitions. [2018-11-18 13:34:22,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-18 13:34:22,259 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:22,280 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 13:34:24,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:24,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 850 states and 1132 transitions. [2018-11-18 13:34:24,476 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1132 transitions. [2018-11-18 13:34:24,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-18 13:34:24,477 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:24,503 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 13:34:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:25,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 866 states and 1147 transitions. [2018-11-18 13:34:25,350 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1147 transitions. [2018-11-18 13:34:25,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-18 13:34:25,351 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 13:34:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:25,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 870 states and 1152 transitions. [2018-11-18 13:34:25,656 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1152 transitions. [2018-11-18 13:34:25,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-18 13:34:25,657 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:25,685 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-18 13:34:26,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:26,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 951 states and 1239 transitions. [2018-11-18 13:34:26,207 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1239 transitions. [2018-11-18 13:34:26,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-18 13:34:26,208 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:26,512 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 13:34:27,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:27,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 961 states and 1264 transitions. [2018-11-18 13:34:27,786 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1264 transitions. [2018-11-18 13:34:27,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-18 13:34:27,787 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:27,810 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 13:34:28,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:28,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 964 states and 1267 transitions. [2018-11-18 13:34:28,028 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1267 transitions. [2018-11-18 13:34:28,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-18 13:34:28,028 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:28,048 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-18 13:34:28,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:28,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 979 states and 1286 transitions. [2018-11-18 13:34:28,552 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1286 transitions. [2018-11-18 13:34:28,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-18 13:34:28,553 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:28,572 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-18 13:34:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:29,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1011 states and 1323 transitions. [2018-11-18 13:34:29,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1323 transitions. [2018-11-18 13:34:29,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-18 13:34:29,790 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:29,823 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-18 13:34:29,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:29,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1012 states and 1323 transitions. [2018-11-18 13:34:29,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1323 transitions. [2018-11-18 13:34:29,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-18 13:34:29,864 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:29,887 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 13:34:29,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:29,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1014 states and 1326 transitions. [2018-11-18 13:34:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1326 transitions. [2018-11-18 13:34:29,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-18 13:34:29,944 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 13:34:30,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:30,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1042 states and 1359 transitions. [2018-11-18 13:34:30,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1359 transitions. [2018-11-18 13:34:30,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-18 13:34:30,710 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:30,743 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:30,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:30,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1056 states and 1373 transitions. [2018-11-18 13:34:30,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1373 transitions. [2018-11-18 13:34:30,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-18 13:34:30,825 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:31,038 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 13:34:32,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:32,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1087 states and 1416 transitions. [2018-11-18 13:34:32,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1416 transitions. [2018-11-18 13:34:32,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 13:34:32,813 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:32,849 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 13:34:33,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:33,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1096 states and 1425 transitions. [2018-11-18 13:34:33,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1425 transitions. [2018-11-18 13:34:33,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-18 13:34:33,143 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:33,180 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 13:34:33,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:33,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1108 states and 1439 transitions. [2018-11-18 13:34:33,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1439 transitions. [2018-11-18 13:34:33,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-18 13:34:33,714 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:33,774 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 13:34:34,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:34,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1130 states and 1467 transitions. [2018-11-18 13:34:34,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1467 transitions. [2018-11-18 13:34:34,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-18 13:34:34,046 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:34,082 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 13:34:34,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1134 states and 1471 transitions. [2018-11-18 13:34:34,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1471 transitions. [2018-11-18 13:34:34,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-18 13:34:34,351 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 13:34:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:34,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1139 states and 1479 transitions. [2018-11-18 13:34:34,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1479 transitions. [2018-11-18 13:34:34,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-18 13:34:34,738 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 13:34:35,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:35,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1140 states and 1479 transitions. [2018-11-18 13:34:35,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1479 transitions. [2018-11-18 13:34:35,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-18 13:34:35,052 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:35,775 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:37,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:37,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1190 states and 1536 transitions. [2018-11-18 13:34:37,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1536 transitions. [2018-11-18 13:34:37,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-18 13:34:37,841 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:37,965 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-18 13:34:38,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:38,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1195 states and 1543 transitions. [2018-11-18 13:34:38,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1543 transitions. [2018-11-18 13:34:38,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-18 13:34:38,276 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:38,313 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 13:34:39,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:39,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1224 states and 1576 transitions. [2018-11-18 13:34:39,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1576 transitions. [2018-11-18 13:34:39,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-18 13:34:39,437 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 13:34:39,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:39,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1226 states and 1577 transitions. [2018-11-18 13:34:39,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1577 transitions. [2018-11-18 13:34:39,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-18 13:34:39,823 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:39,857 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 103 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 13:34:41,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:41,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1293 states and 1658 transitions. [2018-11-18 13:34:41,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1658 transitions. [2018-11-18 13:34:41,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-18 13:34:41,782 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:41,833 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 103 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 13:34:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1299 states and 1664 transitions. [2018-11-18 13:34:42,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1664 transitions. [2018-11-18 13:34:42,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-18 13:34:42,382 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 103 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 13:34:42,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:42,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1304 states and 1669 transitions. [2018-11-18 13:34:42,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1669 transitions. [2018-11-18 13:34:42,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-18 13:34:42,734 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:42,789 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 13:34:44,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:44,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1343 states and 1710 transitions. [2018-11-18 13:34:44,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1710 transitions. [2018-11-18 13:34:44,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-18 13:34:44,156 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:44,211 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 13:34:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:46,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1363 states and 1740 transitions. [2018-11-18 13:34:46,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1740 transitions. [2018-11-18 13:34:46,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-18 13:34:46,438 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:46,493 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 13:34:46,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1368 states and 1745 transitions. [2018-11-18 13:34:46,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1745 transitions. [2018-11-18 13:34:46,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-18 13:34:46,789 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:46,855 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 13:34:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:47,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1373 states and 1750 transitions. [2018-11-18 13:34:47,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1750 transitions. [2018-11-18 13:34:47,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-18 13:34:47,405 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:47,475 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 13:34:48,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:48,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1375 states and 1751 transitions. [2018-11-18 13:34:48,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1751 transitions. [2018-11-18 13:34:48,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-18 13:34:48,120 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:48,146 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 13:34:48,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:48,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1410 states and 1788 transitions. [2018-11-18 13:34:48,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 1788 transitions. [2018-11-18 13:34:48,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-18 13:34:48,720 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:48,812 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 13:34:51,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1473 states and 1858 transitions. [2018-11-18 13:34:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 1858 transitions. [2018-11-18 13:34:51,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-18 13:34:51,434 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:51,467 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 13:34:51,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:51,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1475 states and 1860 transitions. [2018-11-18 13:34:51,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1860 transitions. [2018-11-18 13:34:51,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-18 13:34:51,809 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:51,838 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 13:34:51,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:51,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1482 states and 1867 transitions. [2018-11-18 13:34:51,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1867 transitions. [2018-11-18 13:34:51,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-18 13:34:51,982 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:52,008 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-18 13:34:52,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1509 states and 1899 transitions. [2018-11-18 13:34:52,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1899 transitions. [2018-11-18 13:34:52,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-18 13:34:52,766 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 13:34:53,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:53,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1528 states and 1920 transitions. [2018-11-18 13:34:53,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1920 transitions. [2018-11-18 13:34:53,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-18 13:34:53,772 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 13:34:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:54,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1530 states and 1922 transitions. [2018-11-18 13:34:54,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 1922 transitions. [2018-11-18 13:34:54,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-18 13:34:54,111 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:54,140 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 13:34:55,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:55,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1557 states and 1954 transitions. [2018-11-18 13:34:55,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1954 transitions. [2018-11-18 13:34:55,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-18 13:34:55,932 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 13:34:56,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:56,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1581 states and 1977 transitions. [2018-11-18 13:34:56,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 1977 transitions. [2018-11-18 13:34:56,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-18 13:34:56,444 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:56,474 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 13:34:56,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:34:56,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1583 states and 1979 transitions. [2018-11-18 13:34:56,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 1979 transitions. [2018-11-18 13:34:56,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-18 13:34:56,817 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:34:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:57,051 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 118 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:35:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:35:00,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 1653 states and 2059 transitions. [2018-11-18 13:35:00,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2059 transitions. [2018-11-18 13:35:00,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-18 13:35:00,376 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:35:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:35:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 118 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:35:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:35:01,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 1663 states and 2069 transitions. [2018-11-18 13:35:01,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2069 transitions. [2018-11-18 13:35:01,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-18 13:35:01,892 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:35:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:35:01,981 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 118 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:35:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:35:02,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 1675 states and 2081 transitions. [2018-11-18 13:35:02,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2081 transitions. [2018-11-18 13:35:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-18 13:35:02,570 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:35:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:35:02,728 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 118 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:35:03,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:35:03,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 1688 states and 2098 transitions. [2018-11-18 13:35:03,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 2098 transitions. [2018-11-18 13:35:03,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-18 13:35:03,726 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:35:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:35:03,815 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 118 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:35:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:35:04,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 1692 states and 2101 transitions. [2018-11-18 13:35:04,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 2101 transitions. [2018-11-18 13:35:04,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-18 13:35:04,690 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:35:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:35:04,776 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 118 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:35:04,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:35:04,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 1694 states and 2102 transitions. [2018-11-18 13:35:04,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2102 transitions. [2018-11-18 13:35:04,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-18 13:35:04,958 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:35:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:35:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:35:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:35:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:35:05,158 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 116 iterations. [2018-11-18 13:35:05,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 18.11 01:35:05 ImpRootNode [2018-11-18 13:35:05,276 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-18 13:35:05,276 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:35:05,276 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:35:05,276 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:35:05,278 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:33:50" (3/4) ... [2018-11-18 13:35:05,281 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 13:35:05,400 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2ba48691-2ff6-459c-8d08-3439245506e0/bin-2019/ukojak/witness.graphml [2018-11-18 13:35:05,400 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:35:05,401 INFO L168 Benchmark]: Toolchain (without parser) took 77068.98 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 957.6 MB in the beginning and 1.6 GB in the end (delta: -609.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-18 13:35:05,402 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:35:05,402 INFO L168 Benchmark]: CACSL2BoogieTranslator took 376.95 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 920.1 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-11-18 13:35:05,402 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 920.1 MB in the beginning and 1.1 GB in the end (delta: -206.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-11-18 13:35:05,403 INFO L168 Benchmark]: Boogie Preprocessor took 46.99 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-11-18 13:35:05,403 INFO L168 Benchmark]: RCFGBuilder took 1647.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 886.0 MB in the end (delta: 233.4 MB). Peak memory consumption was 233.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:35:05,403 INFO L168 Benchmark]: CodeCheck took 74763.13 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 886.0 MB in the beginning and 1.6 GB in the end (delta: -680.9 MB). Peak memory consumption was 936.6 MB. Max. memory is 11.5 GB. [2018-11-18 13:35:05,403 INFO L168 Benchmark]: Witness Printer took 124.16 ms. Allocated memory is still 2.8 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:35:05,404 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 199 locations, 1 error locations. UNSAFE Result, 74.6s OverallTime, 116 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1315823040 SDtfs, 384518100 SDslu, -1791942272 SDs, 0 SdLazy, 1310389124 SolverSat, 677245508 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 238.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106391 GetRequests, 103800 SyntacticMatches, 1447 SemanticMatches, 1144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866819 ImplicationChecksByTransitivity, 64.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 14858 NumberOfCodeBlocks, 14858 NumberOfCodeBlocksAsserted, 116 NumberOfCheckSat, 14564 ConstructedInterpolants, 0 QuantifiedInterpolants, 5389429 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 115 InterpolantComputations, 98 PerfectInterpolantSequences, 7928/8157 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: 428]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND TRUE (((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)) [L32] a16 = 5 [L33] a20 = 0 [L34] RET return 24; VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, 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=5, 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=5, 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=5, 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=5, 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 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=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=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND 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=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, 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] [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=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, 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] [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=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, 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] [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=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, 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] [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=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, 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] [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=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, 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] [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=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, 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] [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=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, 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] [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=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, 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] [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=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND 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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [L265] COND TRUE ((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15))) [L266] a17 = 0 [L267] RET return 24; VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=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] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=0, a20=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] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=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] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=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] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=0, a20=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] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=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] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=0, a20=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] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=0, a20=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] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=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] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=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] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=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] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=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] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=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] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=0, a20=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] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=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] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=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] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=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] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=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] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=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] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=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] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=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] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=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] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=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] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=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] [L312] COND TRUE ((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5)) [L313] a8 = 13 [L314] a16 = 4 [L315] RET return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L415] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L418] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L421] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L424] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L427] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L428] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 376.95 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 920.1 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 106.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 920.1 MB in the beginning and 1.1 GB in the end (delta: -206.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.99 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1647.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 886.0 MB in the end (delta: 233.4 MB). Peak memory consumption was 233.4 MB. Max. memory is 11.5 GB. * CodeCheck took 74763.13 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 886.0 MB in the beginning and 1.6 GB in the end (delta: -680.9 MB). Peak memory consumption was 936.6 MB. Max. memory is 11.5 GB. * Witness Printer took 124.16 ms. Allocated memory is still 2.8 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...