./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label45_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cc6ade30-f423-456c-bbf1-8e4b400a8a85/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cc6ade30-f423-456c-bbf1-8e4b400a8a85/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cc6ade30-f423-456c-bbf1-8e4b400a8a85/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cc6ade30-f423-456c-bbf1-8e4b400a8a85/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label45_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_cc6ade30-f423-456c-bbf1-8e4b400a8a85/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cc6ade30-f423-456c-bbf1-8e4b400a8a85/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 eadb33136c36588f3040fbda14d62db855361eef ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 01:09:23,500 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:09:23,501 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:09:23,507 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:09:23,507 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:09:23,507 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:09:23,508 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:09:23,509 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:09:23,510 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:09:23,510 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:09:23,511 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:09:23,511 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:09:23,511 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:09:23,512 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:09:23,512 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:09:23,512 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:09:23,513 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:09:23,514 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:09:23,515 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:09:23,515 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:09:23,516 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:09:23,517 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:09:23,518 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:09:23,518 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:09:23,518 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:09:23,518 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:09:23,519 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:09:23,519 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:09:23,520 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:09:23,520 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:09:23,520 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:09:23,521 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:09:23,521 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:09:23,521 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:09:23,522 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:09:23,522 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:09:23,522 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cc6ade30-f423-456c-bbf1-8e4b400a8a85/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-09 01:09:23,530 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:09:23,530 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:09:23,530 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 01:09:23,530 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-09 01:09:23,531 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:09:23,531 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:09:23,531 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:09:23,531 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:09:23,531 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:09:23,531 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:09:23,531 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:09:23,531 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 01:09:23,531 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 01:09:23,532 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 01:09:23,532 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:09:23,532 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 01:09:23,532 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 01:09:23,532 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 01:09:23,532 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-09 01:09:23,532 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-09 01:09:23,532 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:09:23,532 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 01:09:23,532 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-09 01:09:23,532 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:09:23,533 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 01:09:23,533 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 01:09:23,533 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-09 01:09:23,533 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 01:09:23,533 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 01:09:23,533 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_cc6ade30-f423-456c-bbf1-8e4b400a8a85/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 -> eadb33136c36588f3040fbda14d62db855361eef [2018-12-09 01:09:23,550 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:09:23,556 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:09:23,558 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:09:23,559 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:09:23,559 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:09:23,560 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cc6ade30-f423-456c-bbf1-8e4b400a8a85/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem02_label45_false-unreach-call_false-termination.c [2018-12-09 01:09:23,592 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cc6ade30-f423-456c-bbf1-8e4b400a8a85/bin-2019/ukojak/data/5d5d4cd39/343b0258e9c0401fa1905d3052f4ca80/FLAGcea80412e [2018-12-09 01:09:24,032 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:09:24,033 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cc6ade30-f423-456c-bbf1-8e4b400a8a85/sv-benchmarks/c/eca-rers2012/Problem02_label45_false-unreach-call_false-termination.c [2018-12-09 01:09:24,038 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cc6ade30-f423-456c-bbf1-8e4b400a8a85/bin-2019/ukojak/data/5d5d4cd39/343b0258e9c0401fa1905d3052f4ca80/FLAGcea80412e [2018-12-09 01:09:24,047 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cc6ade30-f423-456c-bbf1-8e4b400a8a85/bin-2019/ukojak/data/5d5d4cd39/343b0258e9c0401fa1905d3052f4ca80 [2018-12-09 01:09:24,048 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:09:24,049 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:09:24,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:09:24,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:09:24,052 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:09:24,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:09:24" (1/1) ... [2018-12-09 01:09:24,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f792852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:09:24, skipping insertion in model container [2018-12-09 01:09:24,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:09:24" (1/1) ... [2018-12-09 01:09:24,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:09:24,080 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:09:24,243 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:09:24,246 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:09:24,324 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:09:24,333 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:09:24,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:09:24 WrapperNode [2018-12-09 01:09:24,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:09:24,334 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 01:09:24,334 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 01:09:24,334 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 01:09:24,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:09:24" (1/1) ... [2018-12-09 01:09:24,347 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:09:24" (1/1) ... [2018-12-09 01:09:24,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 01:09:24,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:09:24,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:09:24,374 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:09:24,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:09:24" (1/1) ... [2018-12-09 01:09:24,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:09:24" (1/1) ... [2018-12-09 01:09:24,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:09:24" (1/1) ... [2018-12-09 01:09:24,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:09:24" (1/1) ... [2018-12-09 01:09:24,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:09:24" (1/1) ... [2018-12-09 01:09:24,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:09:24" (1/1) ... [2018-12-09 01:09:24,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:09:24" (1/1) ... [2018-12-09 01:09:24,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:09:24,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:09:24,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:09:24,402 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:09:24,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:09:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc6ade30-f423-456c-bbf1-8e4b400a8a85/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-09 01:09:24,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:09:24,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:09:25,484 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:09:25,484 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-09 01:09:25,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:09:25 BoogieIcfgContainer [2018-12-09 01:09:25,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:09:25,485 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-09 01:09:25,485 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-09 01:09:25,493 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-09 01:09:25,493 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:09:25" (1/1) ... [2018-12-09 01:09:25,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:09:25,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2018-12-09 01:09:25,529 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2018-12-09 01:09:25,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 01:09:25,532 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 163 states and 242 transitions. [2018-12-09 01:09:26,086 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2018-12-09 01:09:26,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 01:09:26,088 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:26,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:26,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:26,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 242 states and 327 transitions. [2018-12-09 01:09:26,515 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 327 transitions. [2018-12-09 01:09:26,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 01:09:26,517 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:26,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:26,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:26,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 246 states and 333 transitions. [2018-12-09 01:09:26,666 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 333 transitions. [2018-12-09 01:09:26,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-09 01:09:26,668 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:26,706 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 01:09:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:26,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 255 states and 348 transitions. [2018-12-09 01:09:26,899 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 348 transitions. [2018-12-09 01:09:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-09 01:09:26,903 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:26,944 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:27,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:27,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 264 states and 364 transitions. [2018-12-09 01:09:27,089 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 364 transitions. [2018-12-09 01:09:27,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 01:09:27,090 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:27,102 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:27,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:27,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 267 states and 367 transitions. [2018-12-09 01:09:27,118 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 367 transitions. [2018-12-09 01:09:27,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 01:09:27,119 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:27,135 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:27,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 271 states and 372 transitions. [2018-12-09 01:09:27,235 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 372 transitions. [2018-12-09 01:09:27,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 01:09:27,236 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 01:09:27,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:27,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 275 states and 379 transitions. [2018-12-09 01:09:27,423 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 379 transitions. [2018-12-09 01:09:27,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 01:09:27,424 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:27,437 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 01:09:27,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:27,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 278 states and 383 transitions. [2018-12-09 01:09:27,503 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 383 transitions. [2018-12-09 01:09:27,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 01:09:27,504 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:27,578 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:27,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:27,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 295 states and 413 transitions. [2018-12-09 01:09:27,858 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 413 transitions. [2018-12-09 01:09:27,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 01:09:27,859 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:27,871 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:27,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:27,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 302 states and 421 transitions. [2018-12-09 01:09:27,940 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 421 transitions. [2018-12-09 01:09:27,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 01:09:27,941 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:27,954 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 304 states and 423 transitions. [2018-12-09 01:09:27,966 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 423 transitions. [2018-12-09 01:09:27,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 01:09:27,967 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:28,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:28,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 308 states and 432 transitions. [2018-12-09 01:09:28,179 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 432 transitions. [2018-12-09 01:09:28,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 01:09:28,179 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:28,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:28,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 311 states and 436 transitions. [2018-12-09 01:09:28,281 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 436 transitions. [2018-12-09 01:09:28,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 01:09:28,282 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:28,302 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:28,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 314 states and 439 transitions. [2018-12-09 01:09:28,402 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 439 transitions. [2018-12-09 01:09:28,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 01:09:28,403 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:29,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 337 states and 470 transitions. [2018-12-09 01:09:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 470 transitions. [2018-12-09 01:09:29,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 01:09:29,013 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:29,101 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:09:29,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:29,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 416 states and 555 transitions. [2018-12-09 01:09:29,577 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 555 transitions. [2018-12-09 01:09:29,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 01:09:29,578 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:29,590 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:29,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 421 states and 561 transitions. [2018-12-09 01:09:29,716 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 561 transitions. [2018-12-09 01:09:29,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 01:09:29,717 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:29,737 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:09:29,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:29,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 426 states and 565 transitions. [2018-12-09 01:09:29,825 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 565 transitions. [2018-12-09 01:09:29,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 01:09:29,826 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:30,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:30,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 435 states and 577 transitions. [2018-12-09 01:09:30,073 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 577 transitions. [2018-12-09 01:09:30,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-09 01:09:30,074 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:30,095 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 01:09:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:30,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 437 states and 578 transitions. [2018-12-09 01:09:30,201 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 578 transitions. [2018-12-09 01:09:30,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-09 01:09:30,201 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:30,285 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:31,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 465 states and 615 transitions. [2018-12-09 01:09:31,112 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 615 transitions. [2018-12-09 01:09:31,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-09 01:09:31,112 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:31,188 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:31,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:31,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 468 states and 618 transitions. [2018-12-09 01:09:31,300 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 618 transitions. [2018-12-09 01:09:31,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-09 01:09:31,300 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:31,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:31,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 471 states and 621 transitions. [2018-12-09 01:09:31,516 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 621 transitions. [2018-12-09 01:09:31,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-09 01:09:31,517 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:31,597 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:31,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 474 states and 624 transitions. [2018-12-09 01:09:31,713 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 624 transitions. [2018-12-09 01:09:31,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-09 01:09:31,713 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:31,733 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:31,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:31,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 487 states and 638 transitions. [2018-12-09 01:09:31,927 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 638 transitions. [2018-12-09 01:09:31,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-09 01:09:31,927 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 01:09:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:32,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 491 states and 643 transitions. [2018-12-09 01:09:32,114 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 643 transitions. [2018-12-09 01:09:32,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-09 01:09:32,114 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:32,129 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 01:09:32,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:32,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 494 states and 646 transitions. [2018-12-09 01:09:32,239 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 646 transitions. [2018-12-09 01:09:32,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-09 01:09:32,240 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:32,256 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:09:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:32,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 508 states and 662 transitions. [2018-12-09 01:09:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 662 transitions. [2018-12-09 01:09:32,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-09 01:09:32,473 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:32,491 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:32,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:32,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 523 states and 680 transitions. [2018-12-09 01:09:32,661 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 680 transitions. [2018-12-09 01:09:32,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 01:09:32,661 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:09:32,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:32,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 535 states and 692 transitions. [2018-12-09 01:09:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 692 transitions. [2018-12-09 01:09:32,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-09 01:09:32,927 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:32,947 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:32,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:32,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 538 states and 695 transitions. [2018-12-09 01:09:32,966 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 695 transitions. [2018-12-09 01:09:32,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-09 01:09:32,966 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:32,982 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 01:09:33,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:33,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 541 states and 697 transitions. [2018-12-09 01:09:33,062 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 697 transitions. [2018-12-09 01:09:33,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-09 01:09:33,062 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:33,389 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:09:35,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:35,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 581 states and 751 transitions. [2018-12-09 01:09:35,125 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 751 transitions. [2018-12-09 01:09:35,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-09 01:09:35,126 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:35,150 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:09:35,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:35,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 597 states and 768 transitions. [2018-12-09 01:09:35,656 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 768 transitions. [2018-12-09 01:09:35,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-09 01:09:35,656 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:09:36,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:36,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 609 states and 780 transitions. [2018-12-09 01:09:36,075 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 780 transitions. [2018-12-09 01:09:36,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-09 01:09:36,075 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:36,097 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:09:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 614 states and 785 transitions. [2018-12-09 01:09:36,267 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 785 transitions. [2018-12-09 01:09:36,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-09 01:09:36,268 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:36,293 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:09:36,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 615 states and 786 transitions. [2018-12-09 01:09:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 786 transitions. [2018-12-09 01:09:36,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-09 01:09:36,478 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:36,493 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:09:36,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:36,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 618 states and 788 transitions. [2018-12-09 01:09:36,599 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 788 transitions. [2018-12-09 01:09:36,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-09 01:09:36,600 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:36,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:36,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 648 states and 823 transitions. [2018-12-09 01:09:36,712 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 823 transitions. [2018-12-09 01:09:36,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-09 01:09:36,712 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:37,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:37,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 652 states and 828 transitions. [2018-12-09 01:09:37,015 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 828 transitions. [2018-12-09 01:09:37,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-09 01:09:37,016 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:37,035 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:37,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:37,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 668 states and 846 transitions. [2018-12-09 01:09:37,088 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 846 transitions. [2018-12-09 01:09:37,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-09 01:09:37,088 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:37,162 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:37,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:37,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 690 states and 870 transitions. [2018-12-09 01:09:37,469 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 870 transitions. [2018-12-09 01:09:37,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-09 01:09:37,469 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:37,489 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:37,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:37,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 692 states and 872 transitions. [2018-12-09 01:09:37,510 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 872 transitions. [2018-12-09 01:09:37,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-09 01:09:37,510 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:37,824 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 71 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:39,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:39,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 753 states and 946 transitions. [2018-12-09 01:09:39,785 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 946 transitions. [2018-12-09 01:09:39,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-09 01:09:39,785 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 71 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:40,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 756 states and 950 transitions. [2018-12-09 01:09:40,026 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 950 transitions. [2018-12-09 01:09:40,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-09 01:09:40,027 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:40,065 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 71 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:40,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:40,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 759 states and 954 transitions. [2018-12-09 01:09:40,275 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 954 transitions. [2018-12-09 01:09:40,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-09 01:09:40,276 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 71 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:40,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:40,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 762 states and 958 transitions. [2018-12-09 01:09:40,527 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 958 transitions. [2018-12-09 01:09:40,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-09 01:09:40,528 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:40,548 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:40,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 790 states and 990 transitions. [2018-12-09 01:09:40,624 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 990 transitions. [2018-12-09 01:09:40,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-09 01:09:40,625 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:40,897 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:44,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:44,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 852 states and 1060 transitions. [2018-12-09 01:09:44,679 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1060 transitions. [2018-12-09 01:09:44,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-09 01:09:44,680 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:44,707 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-09 01:09:45,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:45,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 872 states and 1083 transitions. [2018-12-09 01:09:45,278 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1083 transitions. [2018-12-09 01:09:45,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-09 01:09:45,278 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:45,423 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:09:46,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 890 states and 1108 transitions. [2018-12-09 01:09:46,438 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1108 transitions. [2018-12-09 01:09:46,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-09 01:09:46,439 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:46,528 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:09:46,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:46,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 891 states and 1109 transitions. [2018-12-09 01:09:46,683 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1109 transitions. [2018-12-09 01:09:46,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-09 01:09:46,684 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:09:47,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:47,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 903 states and 1121 transitions. [2018-12-09 01:09:47,236 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1121 transitions. [2018-12-09 01:09:47,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-09 01:09:47,237 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:47,258 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:09:47,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:47,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 908 states and 1125 transitions. [2018-12-09 01:09:47,373 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1125 transitions. [2018-12-09 01:09:47,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-09 01:09:47,374 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:47,395 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:09:47,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 920 states and 1136 transitions. [2018-12-09 01:09:47,510 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1136 transitions. [2018-12-09 01:09:47,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-09 01:09:47,511 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:47,550 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:48,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:48,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 926 states and 1148 transitions. [2018-12-09 01:09:48,059 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1148 transitions. [2018-12-09 01:09:48,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-09 01:09:48,059 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 78 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:49,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:49,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 952 states and 1181 transitions. [2018-12-09 01:09:49,322 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1181 transitions. [2018-12-09 01:09:49,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-09 01:09:49,323 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:49,338 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-09 01:09:49,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:49,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 955 states and 1184 transitions. [2018-12-09 01:09:49,486 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1184 transitions. [2018-12-09 01:09:49,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-09 01:09:49,486 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 78 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:50,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 968 states and 1197 transitions. [2018-12-09 01:09:50,084 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1197 transitions. [2018-12-09 01:09:50,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-09 01:09:50,085 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 78 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 980 states and 1208 transitions. [2018-12-09 01:09:50,399 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1208 transitions. [2018-12-09 01:09:50,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-09 01:09:50,399 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 01:09:50,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:50,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 985 states and 1213 transitions. [2018-12-09 01:09:50,627 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1213 transitions. [2018-12-09 01:09:50,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-09 01:09:50,627 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:50,663 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 01:09:50,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:50,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 986 states and 1214 transitions. [2018-12-09 01:09:50,894 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1214 transitions. [2018-12-09 01:09:50,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-09 01:09:50,895 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:50,928 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 01:09:51,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:51,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 989 states and 1216 transitions. [2018-12-09 01:09:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1216 transitions. [2018-12-09 01:09:51,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-09 01:09:51,063 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:51,091 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-09 01:09:52,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1015 states and 1243 transitions. [2018-12-09 01:09:52,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1243 transitions. [2018-12-09 01:09:52,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-09 01:09:52,104 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:52,305 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-09 01:09:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1073 states and 1304 transitions. [2018-12-09 01:09:52,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1304 transitions. [2018-12-09 01:09:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-09 01:09:52,843 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:52,865 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:53,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:53,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1074 states and 1306 transitions. [2018-12-09 01:09:53,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1306 transitions. [2018-12-09 01:09:53,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-09 01:09:53,064 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:53,085 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:53,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:53,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1077 states and 1309 transitions. [2018-12-09 01:09:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1309 transitions. [2018-12-09 01:09:53,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-09 01:09:53,265 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:53,342 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:53,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:53,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1092 states and 1328 transitions. [2018-12-09 01:09:53,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1328 transitions. [2018-12-09 01:09:53,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-09 01:09:53,776 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:53,876 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:09:54,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1095 states and 1331 transitions. [2018-12-09 01:09:54,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1331 transitions. [2018-12-09 01:09:54,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-09 01:09:54,091 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:54,112 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:09:54,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1099 states and 1335 transitions. [2018-12-09 01:09:54,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1335 transitions. [2018-12-09 01:09:54,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-09 01:09:54,134 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:54,169 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-09 01:09:54,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:54,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1100 states and 1336 transitions. [2018-12-09 01:09:54,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1336 transitions. [2018-12-09 01:09:54,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-09 01:09:54,202 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:54,229 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:09:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1120 states and 1359 transitions. [2018-12-09 01:09:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1359 transitions. [2018-12-09 01:09:54,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-09 01:09:54,609 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:55,026 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 128 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:09:56,759 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2018-12-09 01:09:57,598 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 25 [2018-12-09 01:09:58,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:58,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1145 states and 1390 transitions. [2018-12-09 01:09:58,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1390 transitions. [2018-12-09 01:09:58,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-09 01:09:58,612 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:58,657 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 128 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:09:58,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1148 states and 1393 transitions. [2018-12-09 01:09:58,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1393 transitions. [2018-12-09 01:09:58,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-09 01:09:58,944 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:58,986 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 128 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:09:59,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1151 states and 1396 transitions. [2018-12-09 01:09:59,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1396 transitions. [2018-12-09 01:09:59,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-09 01:09:59,266 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:59,287 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:09:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1155 states and 1401 transitions. [2018-12-09 01:09:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1401 transitions. [2018-12-09 01:09:59,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-09 01:09:59,312 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-09 01:09:59,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:59,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1160 states and 1405 transitions. [2018-12-09 01:09:59,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1405 transitions. [2018-12-09 01:09:59,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-09 01:09:59,676 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-09 01:10:00,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:00,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1176 states and 1422 transitions. [2018-12-09 01:10:00,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1422 transitions. [2018-12-09 01:10:00,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-09 01:10:00,806 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:00,889 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-09 01:10:01,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:01,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1188 states and 1433 transitions. [2018-12-09 01:10:01,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1433 transitions. [2018-12-09 01:10:01,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-09 01:10:01,401 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:01,430 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 84 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 01:10:01,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:01,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1207 states and 1455 transitions. [2018-12-09 01:10:01,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1455 transitions. [2018-12-09 01:10:01,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-09 01:10:01,779 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:01,815 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:10:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1232 states and 1482 transitions. [2018-12-09 01:10:05,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1482 transitions. [2018-12-09 01:10:05,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-09 01:10:05,203 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:05,228 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 01:10:05,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:05,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1238 states and 1487 transitions. [2018-12-09 01:10:05,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1487 transitions. [2018-12-09 01:10:05,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-09 01:10:05,260 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:05,296 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 97 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 01:10:05,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:05,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1245 states and 1495 transitions. [2018-12-09 01:10:05,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1495 transitions. [2018-12-09 01:10:05,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-09 01:10:05,692 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:05,714 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:10:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:06,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1283 states and 1538 transitions. [2018-12-09 01:10:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1538 transitions. [2018-12-09 01:10:06,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-09 01:10:06,408 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:06,431 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 01:10:06,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:06,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1286 states and 1540 transitions. [2018-12-09 01:10:06,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1540 transitions. [2018-12-09 01:10:06,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-09 01:10:06,563 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:06,589 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 01:10:06,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:06,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1292 states and 1545 transitions. [2018-12-09 01:10:06,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1545 transitions. [2018-12-09 01:10:06,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-09 01:10:06,730 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 106 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 01:10:10,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1313 states and 1565 transitions. [2018-12-09 01:10:10,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1565 transitions. [2018-12-09 01:10:10,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-09 01:10:10,973 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:11,134 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-09 01:10:12,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:12,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1323 states and 1582 transitions. [2018-12-09 01:10:12,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1582 transitions. [2018-12-09 01:10:12,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-09 01:10:12,056 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:12,079 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-09 01:10:12,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1326 states and 1585 transitions. [2018-12-09 01:10:12,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1585 transitions. [2018-12-09 01:10:12,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-09 01:10:12,316 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-09 01:10:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:12,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1329 states and 1588 transitions. [2018-12-09 01:10:12,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1588 transitions. [2018-12-09 01:10:12,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-09 01:10:12,605 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 99 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:10:15,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:15,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1362 states and 1625 transitions. [2018-12-09 01:10:15,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1625 transitions. [2018-12-09 01:10:15,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-09 01:10:15,037 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:15,078 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 99 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:10:15,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:15,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1365 states and 1628 transitions. [2018-12-09 01:10:15,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1628 transitions. [2018-12-09 01:10:15,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-09 01:10:15,390 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:15,559 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-09 01:10:16,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:16,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1370 states and 1636 transitions. [2018-12-09 01:10:16,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1636 transitions. [2018-12-09 01:10:16,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-09 01:10:16,188 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:16,215 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-09 01:10:16,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:16,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1375 states and 1640 transitions. [2018-12-09 01:10:16,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1640 transitions. [2018-12-09 01:10:16,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-09 01:10:16,372 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:16,456 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-09 01:10:16,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:16,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1378 states and 1643 transitions. [2018-12-09 01:10:16,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1643 transitions. [2018-12-09 01:10:16,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-09 01:10:16,525 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:10:17,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:17,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1454 states and 1726 transitions. [2018-12-09 01:10:17,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1726 transitions. [2018-12-09 01:10:17,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-09 01:10:17,785 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:17,808 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-09 01:10:17,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:17,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1457 states and 1729 transitions. [2018-12-09 01:10:17,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1729 transitions. [2018-12-09 01:10:17,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-09 01:10:17,830 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:18,613 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 146 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:10:24,189 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 30 [2018-12-09 01:10:26,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:26,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1532 states and 1825 transitions. [2018-12-09 01:10:26,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1825 transitions. [2018-12-09 01:10:26,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-09 01:10:26,769 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:26,880 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 146 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:10:28,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:28,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1543 states and 1837 transitions. [2018-12-09 01:10:28,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 1837 transitions. [2018-12-09 01:10:28,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-09 01:10:28,016 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:28,097 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-12-09 01:10:28,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:28,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1548 states and 1845 transitions. [2018-12-09 01:10:28,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 1845 transitions. [2018-12-09 01:10:28,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-09 01:10:28,480 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:28,571 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-12-09 01:10:29,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:29,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1552 states and 1850 transitions. [2018-12-09 01:10:29,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 1850 transitions. [2018-12-09 01:10:29,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-09 01:10:29,020 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:29,293 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:10:32,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:32,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1563 states and 1866 transitions. [2018-12-09 01:10:32,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1866 transitions. [2018-12-09 01:10:32,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-09 01:10:32,217 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:32,262 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:10:32,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1568 states and 1870 transitions. [2018-12-09 01:10:32,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 1870 transitions. [2018-12-09 01:10:32,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-09 01:10:32,619 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:32,672 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-09 01:10:33,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:33,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1573 states and 1874 transitions. [2018-12-09 01:10:33,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1874 transitions. [2018-12-09 01:10:33,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-09 01:10:33,267 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:33,395 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 109 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-09 01:10:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1605 states and 1905 transitions. [2018-12-09 01:10:33,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1905 transitions. [2018-12-09 01:10:33,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-09 01:10:33,525 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:33,562 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 109 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 01:10:34,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:34,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1609 states and 1911 transitions. [2018-12-09 01:10:34,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 1911 transitions. [2018-12-09 01:10:34,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-09 01:10:34,264 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 109 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 01:10:34,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:34,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1612 states and 1914 transitions. [2018-12-09 01:10:34,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 1914 transitions. [2018-12-09 01:10:34,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-09 01:10:34,625 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:34,668 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 109 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 01:10:34,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:34,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1615 states and 1917 transitions. [2018-12-09 01:10:34,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 1917 transitions. [2018-12-09 01:10:34,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-09 01:10:34,973 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:35,101 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 153 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:10:36,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:36,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1622 states and 1930 transitions. [2018-12-09 01:10:36,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1930 transitions. [2018-12-09 01:10:36,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-09 01:10:36,827 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:36,959 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 153 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:10:38,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1624 states and 1932 transitions. [2018-12-09 01:10:38,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 1932 transitions. [2018-12-09 01:10:38,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-09 01:10:38,038 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:38,113 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 148 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:10:38,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:38,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1628 states and 1937 transitions. [2018-12-09 01:10:38,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 1937 transitions. [2018-12-09 01:10:38,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-09 01:10:38,686 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:38,847 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 01:10:39,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:39,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 1708 states and 2017 transitions. [2018-12-09 01:10:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2017 transitions. [2018-12-09 01:10:39,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-09 01:10:39,815 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:40,154 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-12-09 01:10:45,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 1771 states and 2086 transitions. [2018-12-09 01:10:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2086 transitions. [2018-12-09 01:10:45,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-09 01:10:45,375 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:45,463 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 122 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 01:10:46,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:46,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 1804 states and 2127 transitions. [2018-12-09 01:10:46,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2127 transitions. [2018-12-09 01:10:46,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-09 01:10:46,886 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:46,979 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 122 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 01:10:47,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:47,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 1807 states and 2130 transitions. [2018-12-09 01:10:47,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2130 transitions. [2018-12-09 01:10:47,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-09 01:10:47,262 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:47,369 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 122 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 01:10:47,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:47,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 1810 states and 2133 transitions. [2018-12-09 01:10:47,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2133 transitions. [2018-12-09 01:10:47,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-09 01:10:47,735 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:47,826 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 122 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 01:10:48,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:48,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 1813 states and 2136 transitions. [2018-12-09 01:10:48,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2136 transitions. [2018-12-09 01:10:48,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-09 01:10:48,137 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:48,174 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 114 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 01:10:55,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 1894 states and 2245 transitions. [2018-12-09 01:10:55,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2245 transitions. [2018-12-09 01:10:55,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-09 01:10:55,701 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 114 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 01:10:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 1962 states and 2313 transitions. [2018-12-09 01:10:59,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2313 transitions. [2018-12-09 01:10:59,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-09 01:10:59,363 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 114 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 01:11:00,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:00,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 1975 states and 2326 transitions. [2018-12-09 01:11:00,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2326 transitions. [2018-12-09 01:11:00,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-09 01:11:00,075 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:00,110 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 114 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 01:11:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:00,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 1987 states and 2337 transitions. [2018-12-09 01:11:00,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2337 transitions. [2018-12-09 01:11:00,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-09 01:11:00,543 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:00,569 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-09 01:11:00,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:00,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 1992 states and 2344 transitions. [2018-12-09 01:11:00,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2344 transitions. [2018-12-09 01:11:00,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-09 01:11:00,905 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:00,941 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-09 01:11:01,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 1994 states and 2345 transitions. [2018-12-09 01:11:01,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2345 transitions. [2018-12-09 01:11:01,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-09 01:11:01,122 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:11:01,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:01,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 2000 states and 2354 transitions. [2018-12-09 01:11:01,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2354 transitions. [2018-12-09 01:11:01,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-09 01:11:01,853 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:01,882 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-09 01:11:07,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:07,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2404 states to 2048 states and 2404 transitions. [2018-12-09 01:11:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2404 transitions. [2018-12-09 01:11:07,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-09 01:11:07,215 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-09 01:11:07,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2053 states and 2408 transitions. [2018-12-09 01:11:07,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2408 transitions. [2018-12-09 01:11:07,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-12-09 01:11:07,598 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:07,651 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 01:11:08,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:08,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2074 states and 2428 transitions. [2018-12-09 01:11:08,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 2428 transitions. [2018-12-09 01:11:08,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-09 01:11:08,047 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:08,081 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-09 01:11:08,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:08,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2078 states and 2432 transitions. [2018-12-09 01:11:08,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 2432 transitions. [2018-12-09 01:11:08,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-09 01:11:08,623 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:09,423 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-09 01:11:17,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2108 states and 2469 transitions. [2018-12-09 01:11:17,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 2469 transitions. [2018-12-09 01:11:17,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-09 01:11:17,330 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:17,439 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-09 01:11:18,835 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2018-12-09 01:11:21,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:21,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 2124 states and 2484 transitions. [2018-12-09 01:11:21,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 2484 transitions. [2018-12-09 01:11:21,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-09 01:11:21,517 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 01:11:25,510 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2018-12-09 01:11:33,542 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 24 [2018-12-09 01:11:37,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:37,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2177 states and 2539 transitions. [2018-12-09 01:11:37,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2177 states and 2539 transitions. [2018-12-09 01:11:37,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-09 01:11:37,457 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:37,580 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 01:11:39,393 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-12-09 01:11:42,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2210 states and 2571 transitions. [2018-12-09 01:11:42,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 2571 transitions. [2018-12-09 01:11:42,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-09 01:11:42,365 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 01:11:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:43,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2223 states and 2583 transitions. [2018-12-09 01:11:43,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 2583 transitions. [2018-12-09 01:11:43,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-09 01:11:43,501 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:44,454 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 175 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:11:52,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:52,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2262 states and 2634 transitions. [2018-12-09 01:11:52,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 2634 transitions. [2018-12-09 01:11:52,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-09 01:11:52,099 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 175 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:11:53,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:53,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2269 states and 2640 transitions. [2018-12-09 01:11:53,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2269 states and 2640 transitions. [2018-12-09 01:11:53,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-09 01:11:53,084 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:53,453 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 175 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:11:53,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2273 states and 2643 transitions. [2018-12-09 01:11:53,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 2643 transitions. [2018-12-09 01:11:53,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-09 01:11:53,968 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 174 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:11:55,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:55,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2292 states and 2666 transitions. [2018-12-09 01:11:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 2666 transitions. [2018-12-09 01:11:55,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-09 01:11:55,677 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:56,031 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 174 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:11:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:56,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2294 states and 2669 transitions. [2018-12-09 01:11:56,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 2669 transitions. [2018-12-09 01:11:56,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-09 01:11:56,725 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:57,922 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:12:00,686 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 31 [2018-12-09 01:12:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:04,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2329 states and 2711 transitions. [2018-12-09 01:12:04,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 2711 transitions. [2018-12-09 01:12:04,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-09 01:12:04,947 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:12:10,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2748 states to 2367 states and 2748 transitions. [2018-12-09 01:12:10,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2748 transitions. [2018-12-09 01:12:10,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-09 01:12:10,979 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:11,114 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:12:11,948 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-12-09 01:12:12,226 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-12-09 01:12:14,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:14,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2767 states to 2386 states and 2767 transitions. [2018-12-09 01:12:14,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 2767 transitions. [2018-12-09 01:12:14,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-09 01:12:14,782 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 01:12:19,634 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2018-12-09 01:12:22,968 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2018-12-09 01:12:32,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:32,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2423 states and 2806 transitions. [2018-12-09 01:12:32,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 2806 transitions. [2018-12-09 01:12:32,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-09 01:12:32,270 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 01:12:33,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:33,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2433 states and 2814 transitions. [2018-12-09 01:12:33,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 2814 transitions. [2018-12-09 01:12:33,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-09 01:12:33,898 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:34,041 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-09 01:12:36,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:36,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2450 states and 2840 transitions. [2018-12-09 01:12:36,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 2840 transitions. [2018-12-09 01:12:36,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-09 01:12:36,438 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-09 01:12:37,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:37,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2461 states and 2850 transitions. [2018-12-09 01:12:37,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 2850 transitions. [2018-12-09 01:12:37,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-09 01:12:37,505 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-09 01:12:38,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2464 states and 2853 transitions. [2018-12-09 01:12:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2464 states and 2853 transitions. [2018-12-09 01:12:38,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-12-09 01:12:38,073 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:38,116 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-09 01:12:38,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:38,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2467 states and 2855 transitions. [2018-12-09 01:12:38,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 2855 transitions. [2018-12-09 01:12:38,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-09 01:12:38,361 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:38,452 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-09 01:12:39,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:39,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2468 states and 2857 transitions. [2018-12-09 01:12:39,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 2857 transitions. [2018-12-09 01:12:39,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-09 01:12:39,222 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:39,312 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-09 01:12:42,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:42,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2482 states and 2871 transitions. [2018-12-09 01:12:42,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 2871 transitions. [2018-12-09 01:12:42,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-09 01:12:42,118 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:42,214 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-09 01:12:44,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:44,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2494 states and 2882 transitions. [2018-12-09 01:12:44,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2494 states and 2882 transitions. [2018-12-09 01:12:44,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-09 01:12:44,361 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:44,424 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-12-09 01:12:45,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:45,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2569 states and 2959 transitions. [2018-12-09 01:12:45,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 2959 transitions. [2018-12-09 01:12:45,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-12-09 01:12:45,522 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:45,580 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-09 01:12:45,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:45,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2970 states to 2581 states and 2970 transitions. [2018-12-09 01:12:45,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2581 states and 2970 transitions. [2018-12-09 01:12:45,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-12-09 01:12:45,859 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:12:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:12:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:12:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:12:46,039 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 154 iterations. [2018-12-09 01:12:46,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.12 01:12:46 ImpRootNode [2018-12-09 01:12:46,133 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-09 01:12:46,133 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:12:46,133 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:12:46,133 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:12:46,133 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:09:25" (3/4) ... [2018-12-09 01:12:46,135 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 01:12:46,217 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_cc6ade30-f423-456c-bbf1-8e4b400a8a85/bin-2019/ukojak/witness.graphml [2018-12-09 01:12:46,217 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 01:12:46,217 INFO L168 Benchmark]: Toolchain (without parser) took 202168.92 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 493.4 MB). Free memory was 951.7 MB in the beginning and 1.2 GB in the end (delta: -258.9 MB). Peak memory consumption was 234.5 MB. Max. memory is 11.5 GB. [2018-12-09 01:12:46,218 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:12:46,218 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-12-09 01:12:46,218 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.64 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.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-09 01:12:46,218 INFO L168 Benchmark]: Boogie Preprocessor took 28.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:12:46,218 INFO L168 Benchmark]: RCFGBuilder took 1082.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 876.0 MB in the end (delta: 228.2 MB). Peak memory consumption was 228.2 MB. Max. memory is 11.5 GB. [2018-12-09 01:12:46,218 INFO L168 Benchmark]: CodeCheck took 200647.73 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 364.9 MB). Free memory was 876.0 MB in the beginning and 1.2 GB in the end (delta: -361.4 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-09 01:12:46,219 INFO L168 Benchmark]: Witness Printer took 84.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-12-09 01:12:46,220 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, 227 locations, 1 error locations. UNSAFE Result, 200.5s OverallTime, 154 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1191241480 SDtfs, -1933408222 SDslu, -1425722832 SDs, 0 SdLazy, 413752336 SolverSat, 187428770 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 483.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 165241 GetRequests, 160366 SyntacticMatches, 3561 SemanticMatches, 1314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1346251 ImplicationChecksByTransitivity, 181.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 25214 NumberOfCodeBlocks, 25214 NumberOfCodeBlocksAsserted, 154 NumberOfCheckSat, 24834 ConstructedInterpolants, 0 QuantifiedInterpolants, 19122625 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 153 InterpolantComputations, 109 PerfectInterpolantSequences, 17216/17924 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: 418]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L235] a28 = 9 [L236] return 23; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L395] a19 = 0 [L396] a28 = 7 [L397] return 25; VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND TRUE ((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1)) [L149] a11 = 1 [L150] a19 = 1 [L151] a28 = 10 [L152] a25 = 1 [L153] return -1; VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L418] __VERIFIER_error() VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 283.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.64 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.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1082.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 876.0 MB in the end (delta: 228.2 MB). Peak memory consumption was 228.2 MB. Max. memory is 11.5 GB. * CodeCheck took 200647.73 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 364.9 MB). Free memory was 876.0 MB in the beginning and 1.2 GB in the end (delta: -361.4 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Witness Printer took 84.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...