./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label47.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b0af59ff-dfca-4d01-8c09-5aaba0bf03b6/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b0af59ff-dfca-4d01-8c09-5aaba0bf03b6/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b0af59ff-dfca-4d01-8c09-5aaba0bf03b6/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b0af59ff-dfca-4d01-8c09-5aaba0bf03b6/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label47.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b0af59ff-dfca-4d01-8c09-5aaba0bf03b6/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b0af59ff-dfca-4d01-8c09-5aaba0bf03b6/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db6e7a7f3be179438223abf82c6cabe8d26d1cb7 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 00:22:35,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:22:35,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:22:35,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:22:35,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:22:35,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:22:35,254 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:22:35,256 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:22:35,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:22:35,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:22:35,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:22:35,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:22:35,261 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:22:35,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:22:35,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:22:35,264 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:22:35,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:22:35,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:22:35,267 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:22:35,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:22:35,273 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:22:35,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:22:35,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:22:35,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:22:35,278 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:22:35,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:22:35,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:22:35,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:22:35,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:22:35,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:22:35,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:22:35,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:22:35,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:22:35,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:22:35,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:22:35,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:22:35,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:22:35,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:22:35,285 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:22:35,286 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:22:35,291 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:22:35,292 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b0af59ff-dfca-4d01-8c09-5aaba0bf03b6/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-11-20 00:22:35,312 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:22:35,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:22:35,313 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-20 00:22:35,313 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-20 00:22:35,313 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:22:35,314 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:22:35,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:22:35,314 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:22:35,314 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:22:35,314 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:22:35,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:22:35,315 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:22:35,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:22:35,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:22:35,316 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:22:35,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:22:35,316 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:22:35,317 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:22:35,317 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-20 00:22:35,317 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-20 00:22:35,317 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:22:35,318 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:22:35,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 00:22:35,318 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:22:35,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:22:35,318 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:22:35,319 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-11-20 00:22:35,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 00:22:35,319 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:22:35,319 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_b0af59ff-dfca-4d01-8c09-5aaba0bf03b6/bin/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db6e7a7f3be179438223abf82c6cabe8d26d1cb7 [2019-11-20 00:22:35,485 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:22:35,495 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:22:35,497 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:22:35,499 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:22:35,499 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:22:35,499 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b0af59ff-dfca-4d01-8c09-5aaba0bf03b6/bin/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label47.c [2019-11-20 00:22:35,546 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b0af59ff-dfca-4d01-8c09-5aaba0bf03b6/bin/ukojak/data/a5769fd39/6facfe6d66b348b88042966827a25339/FLAG243bb7f54 [2019-11-20 00:22:36,010 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:22:36,010 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b0af59ff-dfca-4d01-8c09-5aaba0bf03b6/sv-benchmarks/c/eca-rers2012/Problem01_label47.c [2019-11-20 00:22:36,022 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b0af59ff-dfca-4d01-8c09-5aaba0bf03b6/bin/ukojak/data/a5769fd39/6facfe6d66b348b88042966827a25339/FLAG243bb7f54 [2019-11-20 00:22:36,038 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b0af59ff-dfca-4d01-8c09-5aaba0bf03b6/bin/ukojak/data/a5769fd39/6facfe6d66b348b88042966827a25339 [2019-11-20 00:22:36,041 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:22:36,047 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:22:36,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:22:36,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:22:36,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:22:36,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:22:36" (1/1) ... [2019-11-20 00:22:36,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aa158c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:22:36, skipping insertion in model container [2019-11-20 00:22:36,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:22:36" (1/1) ... [2019-11-20 00:22:36,063 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:22:36,103 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:22:36,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:22:36,544 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:22:36,653 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:22:36,667 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:22:36,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:22:36 WrapperNode [2019-11-20 00:22:36,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:22:36,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:22:36,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:22:36,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:22:36,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:22:36" (1/1) ... [2019-11-20 00:22:36,696 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:22:36" (1/1) ... [2019-11-20 00:22:36,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:22:36,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:22:36,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:22:36,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:22:36,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:22:36" (1/1) ... [2019-11-20 00:22:36,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:22:36" (1/1) ... [2019-11-20 00:22:36,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:22:36" (1/1) ... [2019-11-20 00:22:36,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:22:36" (1/1) ... [2019-11-20 00:22:36,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:22:36" (1/1) ... [2019-11-20 00:22:36,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:22:36" (1/1) ... [2019-11-20 00:22:36,834 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:22:36" (1/1) ... [2019-11-20 00:22:36,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:22:36,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:22:36,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:22:36,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:22:36,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:22:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b0af59ff-dfca-4d01-8c09-5aaba0bf03b6/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 00:22:36,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:22:36,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:22:38,785 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:22:38,786 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 00:22:38,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:22:38 BoogieIcfgContainer [2019-11-20 00:22:38,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:22:38,788 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-20 00:22:38,788 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-20 00:22:38,798 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-20 00:22:38,800 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:22:38" (1/1) ... [2019-11-20 00:22:38,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:22:38,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:38,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2019-11-20 00:22:38,851 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2019-11-20 00:22:38,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 00:22:38,857 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:39,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:39,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 145 states and 239 transitions. [2019-11-20 00:22:39,796 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 239 transitions. [2019-11-20 00:22:39,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 00:22:39,799 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:39,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:40,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 146 states and 240 transitions. [2019-11-20 00:22:40,337 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 240 transitions. [2019-11-20 00:22:40,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 00:22:40,339 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:40,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:40,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:40,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 150 states and 247 transitions. [2019-11-20 00:22:40,514 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 247 transitions. [2019-11-20 00:22:40,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 00:22:40,516 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:40,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:40,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:40,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 151 states and 249 transitions. [2019-11-20 00:22:40,667 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 249 transitions. [2019-11-20 00:22:40,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-20 00:22:40,672 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:40,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:41,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:41,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 221 states and 323 transitions. [2019-11-20 00:22:41,518 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 323 transitions. [2019-11-20 00:22:41,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-20 00:22:41,520 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:42,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 228 states and 337 transitions. [2019-11-20 00:22:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 337 transitions. [2019-11-20 00:22:42,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 00:22:42,082 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,108 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:22:42,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:42,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 229 states and 338 transitions. [2019-11-20 00:22:42,175 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 338 transitions. [2019-11-20 00:22:42,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 00:22:42,176 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:42,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:42,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 232 states and 343 transitions. [2019-11-20 00:22:42,290 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 343 transitions. [2019-11-20 00:22:42,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 00:22:42,291 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 240 states and 359 transitions. [2019-11-20 00:22:43,237 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 359 transitions. [2019-11-20 00:22:43,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 00:22:43,239 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 00:22:43,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:43,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 245 states and 368 transitions. [2019-11-20 00:22:43,590 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 368 transitions. [2019-11-20 00:22:43,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 00:22:43,591 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,640 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:43,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 248 states and 371 transitions. [2019-11-20 00:22:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 371 transitions. [2019-11-20 00:22:43,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 00:22:43,920 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:43,976 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:44,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:44,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 253 states and 377 transitions. [2019-11-20 00:22:44,025 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 377 transitions. [2019-11-20 00:22:44,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 00:22:44,027 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:44,077 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:22:44,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 258 states and 385 transitions. [2019-11-20 00:22:44,294 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 385 transitions. [2019-11-20 00:22:44,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 00:22:44,295 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:44,322 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:22:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 259 states and 386 transitions. [2019-11-20 00:22:44,411 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 386 transitions. [2019-11-20 00:22:44,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 00:22:44,413 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:44,438 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:22:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 262 states and 389 transitions. [2019-11-20 00:22:44,595 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 389 transitions. [2019-11-20 00:22:44,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 00:22:44,596 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:44,769 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:45,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:45,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 276 states and 411 transitions. [2019-11-20 00:22:45,885 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 411 transitions. [2019-11-20 00:22:45,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 00:22:45,888 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:45,912 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:46,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 280 states and 418 transitions. [2019-11-20 00:22:46,212 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 418 transitions. [2019-11-20 00:22:46,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 00:22:46,213 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:46,240 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:22:46,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:46,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 281 states and 419 transitions. [2019-11-20 00:22:46,352 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 419 transitions. [2019-11-20 00:22:46,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 00:22:46,353 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:46,446 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:47,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:47,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 291 states and 430 transitions. [2019-11-20 00:22:47,417 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 430 transitions. [2019-11-20 00:22:47,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 00:22:47,419 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:22:47,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 292 states and 430 transitions. [2019-11-20 00:22:47,585 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 430 transitions. [2019-11-20 00:22:47,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 00:22:47,586 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:47,619 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:22:47,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:47,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 297 states and 435 transitions. [2019-11-20 00:22:47,665 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 435 transitions. [2019-11-20 00:22:47,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-20 00:22:47,666 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:47,694 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:48,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:48,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 303 states and 443 transitions. [2019-11-20 00:22:48,266 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 443 transitions. [2019-11-20 00:22:48,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-20 00:22:48,268 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:48,292 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:48,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 307 states and 446 transitions. [2019-11-20 00:22:48,591 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 446 transitions. [2019-11-20 00:22:48,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-20 00:22:48,592 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:49,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:49,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 325 states and 472 transitions. [2019-11-20 00:22:49,821 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 472 transitions. [2019-11-20 00:22:49,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 00:22:49,822 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:22:50,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 329 states and 479 transitions. [2019-11-20 00:22:50,139 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 479 transitions. [2019-11-20 00:22:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 00:22:50,140 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,181 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:22:50,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:50,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 336 states and 489 transitions. [2019-11-20 00:22:50,461 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 489 transitions. [2019-11-20 00:22:50,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 00:22:50,462 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,490 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:22:50,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 338 states and 490 transitions. [2019-11-20 00:22:50,636 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 490 transitions. [2019-11-20 00:22:50,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 00:22:50,637 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:22:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 339 states and 492 transitions. [2019-11-20 00:22:50,996 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 492 transitions. [2019-11-20 00:22:50,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 00:22:50,998 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,025 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:22:51,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:51,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 340 states and 494 transitions. [2019-11-20 00:22:51,210 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 494 transitions. [2019-11-20 00:22:51,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 00:22:51,211 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,241 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 347 states and 503 transitions. [2019-11-20 00:22:51,545 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 503 transitions. [2019-11-20 00:22:51,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 00:22:51,547 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:22:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:51,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 349 states and 505 transitions. [2019-11-20 00:22:51,727 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 505 transitions. [2019-11-20 00:22:51,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 00:22:51,729 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:51,901 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:53,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:53,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 376 states and 541 transitions. [2019-11-20 00:22:53,529 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 541 transitions. [2019-11-20 00:22:53,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 00:22:53,531 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:53,678 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:55,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 398 states and 577 transitions. [2019-11-20 00:22:55,309 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 577 transitions. [2019-11-20 00:22:55,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 00:22:55,310 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:55,361 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:55,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:55,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 402 states and 580 transitions. [2019-11-20 00:22:55,601 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 580 transitions. [2019-11-20 00:22:55,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 00:22:55,603 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:55,719 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:56,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 418 states and 599 transitions. [2019-11-20 00:22:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 599 transitions. [2019-11-20 00:22:56,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 00:22:56,675 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:56,708 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:22:57,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 425 states and 608 transitions. [2019-11-20 00:22:57,017 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 608 transitions. [2019-11-20 00:22:57,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 00:22:57,018 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:57,043 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:22:57,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:57,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 430 states and 613 transitions. [2019-11-20 00:22:57,079 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 613 transitions. [2019-11-20 00:22:57,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 00:22:57,081 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:57,105 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:22:57,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:57,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 431 states and 614 transitions. [2019-11-20 00:22:57,270 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 614 transitions. [2019-11-20 00:22:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 00:22:57,271 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:57,317 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 434 states and 617 transitions. [2019-11-20 00:22:57,519 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 617 transitions. [2019-11-20 00:22:57,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 00:22:57,520 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:58,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:58,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 455 states and 642 transitions. [2019-11-20 00:22:58,465 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 642 transitions. [2019-11-20 00:22:58,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 00:22:58,466 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:22:59,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:22:59,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 466 states and 652 transitions. [2019-11-20 00:22:59,237 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 652 transitions. [2019-11-20 00:22:59,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 00:22:59,238 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:22:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:22:59,924 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:23:01,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:01,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 473 states and 664 transitions. [2019-11-20 00:23:01,200 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 664 transitions. [2019-11-20 00:23:01,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 00:23:01,200 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:01,230 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:23:01,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:01,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 480 states and 671 transitions. [2019-11-20 00:23:01,481 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 671 transitions. [2019-11-20 00:23:01,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 00:23:01,482 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:01,511 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:23:01,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:01,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 487 states and 678 transitions. [2019-11-20 00:23:01,577 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 678 transitions. [2019-11-20 00:23:01,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 00:23:01,578 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:01,608 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:23:01,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:01,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 489 states and 682 transitions. [2019-11-20 00:23:01,769 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 682 transitions. [2019-11-20 00:23:01,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 00:23:01,771 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:01,804 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:23:01,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:01,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 491 states and 684 transitions. [2019-11-20 00:23:01,839 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 684 transitions. [2019-11-20 00:23:01,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 00:23:01,840 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:01,984 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:23:02,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:02,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 495 states and 690 transitions. [2019-11-20 00:23:02,727 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 690 transitions. [2019-11-20 00:23:02,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 00:23:02,727 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:03,048 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:23:05,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:05,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 525 states and 728 transitions. [2019-11-20 00:23:05,618 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 728 transitions. [2019-11-20 00:23:05,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 00:23:05,619 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:05,667 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:23:06,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:06,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 539 states and 749 transitions. [2019-11-20 00:23:06,689 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 749 transitions. [2019-11-20 00:23:06,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 00:23:06,690 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:06,743 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:23:07,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:07,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 545 states and 756 transitions. [2019-11-20 00:23:07,316 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 756 transitions. [2019-11-20 00:23:07,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 00:23:07,317 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:07,374 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:23:07,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:07,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 552 states and 763 transitions. [2019-11-20 00:23:07,760 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 763 transitions. [2019-11-20 00:23:07,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-20 00:23:07,761 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:23:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 557 states and 769 transitions. [2019-11-20 00:23:08,087 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 769 transitions. [2019-11-20 00:23:08,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 00:23:08,088 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:08,124 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:23:10,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:10,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 587 states and 806 transitions. [2019-11-20 00:23:10,660 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 806 transitions. [2019-11-20 00:23:10,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 00:23:10,660 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:10,695 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:23:11,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:11,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 602 states and 823 transitions. [2019-11-20 00:23:11,624 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 823 transitions. [2019-11-20 00:23:11,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 00:23:11,626 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:11,655 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:23:11,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:11,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 606 states and 829 transitions. [2019-11-20 00:23:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 829 transitions. [2019-11-20 00:23:11,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-20 00:23:11,715 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:11,830 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:23:13,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 611 states and 838 transitions. [2019-11-20 00:23:13,186 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 838 transitions. [2019-11-20 00:23:13,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-20 00:23:13,187 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,221 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:23:13,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:13,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 614 states and 841 transitions. [2019-11-20 00:23:13,852 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 841 transitions. [2019-11-20 00:23:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 00:23:13,853 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:13,951 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:23:15,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:15,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 621 states and 853 transitions. [2019-11-20 00:23:15,633 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 853 transitions. [2019-11-20 00:23:15,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 00:23:15,634 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:15,687 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:23:16,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:16,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 622 states and 854 transitions. [2019-11-20 00:23:16,211 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 854 transitions. [2019-11-20 00:23:16,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 00:23:16,212 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:16,260 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:23:16,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 623 states and 855 transitions. [2019-11-20 00:23:16,767 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 855 transitions. [2019-11-20 00:23:16,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 00:23:16,768 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:23:17,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 629 states and 863 transitions. [2019-11-20 00:23:17,628 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 863 transitions. [2019-11-20 00:23:17,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-20 00:23:17,628 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:17,660 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:23:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:18,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 638 states and 871 transitions. [2019-11-20 00:23:18,514 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 871 transitions. [2019-11-20 00:23:18,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-20 00:23:18,514 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:23:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 663 states and 912 transitions. [2019-11-20 00:23:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 912 transitions. [2019-11-20 00:23:21,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-20 00:23:21,415 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:21,620 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:23:23,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:23,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 675 states and 932 transitions. [2019-11-20 00:23:23,822 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 932 transitions. [2019-11-20 00:23:23,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 00:23:23,823 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:23:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 700 states and 958 transitions. [2019-11-20 00:23:25,008 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 958 transitions. [2019-11-20 00:23:25,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 00:23:25,010 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:25,042 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:23:26,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:26,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 711 states and 974 transitions. [2019-11-20 00:23:26,305 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 974 transitions. [2019-11-20 00:23:26,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 00:23:26,306 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:23:27,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:27,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 718 states and 982 transitions. [2019-11-20 00:23:27,270 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 982 transitions. [2019-11-20 00:23:27,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 00:23:27,271 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:27,303 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:23:27,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 719 states and 983 transitions. [2019-11-20 00:23:27,761 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 983 transitions. [2019-11-20 00:23:27,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 00:23:27,762 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:27,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:27,799 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:23:28,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:28,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 721 states and 984 transitions. [2019-11-20 00:23:28,001 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 984 transitions. [2019-11-20 00:23:28,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 00:23:28,002 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:28,095 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:23:28,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:28,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 723 states and 985 transitions. [2019-11-20 00:23:28,310 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 985 transitions. [2019-11-20 00:23:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 00:23:28,311 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:28,340 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:23:28,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:28,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 733 states and 996 transitions. [2019-11-20 00:23:28,420 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 996 transitions. [2019-11-20 00:23:28,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 00:23:28,422 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:28,458 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:23:28,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:28,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 734 states and 997 transitions. [2019-11-20 00:23:28,690 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 997 transitions. [2019-11-20 00:23:28,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 00:23:28,691 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:28,744 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:23:30,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:30,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 747 states and 1019 transitions. [2019-11-20 00:23:30,376 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1019 transitions. [2019-11-20 00:23:30,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 00:23:30,377 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:23:34,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:34,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 789 states and 1063 transitions. [2019-11-20 00:23:34,549 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1063 transitions. [2019-11-20 00:23:34,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 00:23:34,550 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:34,840 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:23:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:36,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 799 states and 1083 transitions. [2019-11-20 00:23:36,344 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1083 transitions. [2019-11-20 00:23:36,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 00:23:36,345 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:36,377 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:23:36,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 800 states and 1083 transitions. [2019-11-20 00:23:36,592 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1083 transitions. [2019-11-20 00:23:36,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 00:23:36,593 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:36,627 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:23:37,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:37,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 801 states and 1084 transitions. [2019-11-20 00:23:37,021 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1084 transitions. [2019-11-20 00:23:37,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-20 00:23:37,022 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:37,067 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:23:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:38,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 811 states and 1096 transitions. [2019-11-20 00:23:38,386 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1096 transitions. [2019-11-20 00:23:38,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-20 00:23:38,387 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:38,456 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:23:38,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:38,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 813 states and 1098 transitions. [2019-11-20 00:23:38,847 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1098 transitions. [2019-11-20 00:23:38,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-20 00:23:38,848 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:38,886 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:23:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:41,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 827 states and 1120 transitions. [2019-11-20 00:23:41,791 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1120 transitions. [2019-11-20 00:23:41,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-20 00:23:41,792 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:41,835 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:23:42,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:42,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 830 states and 1124 transitions. [2019-11-20 00:23:42,731 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1124 transitions. [2019-11-20 00:23:42,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-20 00:23:42,732 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:42,845 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:23:43,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:43,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 832 states and 1126 transitions. [2019-11-20 00:23:43,587 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1126 transitions. [2019-11-20 00:23:43,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-20 00:23:43,588 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:43,618 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:23:44,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 837 states and 1132 transitions. [2019-11-20 00:23:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1132 transitions. [2019-11-20 00:23:44,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:23:44,139 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 00:23:44,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:44,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 839 states and 1135 transitions. [2019-11-20 00:23:44,391 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1135 transitions. [2019-11-20 00:23:44,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:23:44,392 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:44,422 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 00:23:44,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:44,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 840 states and 1136 transitions. [2019-11-20 00:23:44,460 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1136 transitions. [2019-11-20 00:23:44,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:23:44,461 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:23:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 878 states and 1181 transitions. [2019-11-20 00:23:48,520 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1181 transitions. [2019-11-20 00:23:48,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:23:48,522 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:48,564 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:23:49,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:49,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 888 states and 1190 transitions. [2019-11-20 00:23:49,319 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1190 transitions. [2019-11-20 00:23:49,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:23:49,320 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:49,359 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:23:50,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 932 states and 1236 transitions. [2019-11-20 00:23:50,557 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1236 transitions. [2019-11-20 00:23:50,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:23:50,558 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:50,590 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:23:50,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:50,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 933 states and 1237 transitions. [2019-11-20 00:23:50,825 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1237 transitions. [2019-11-20 00:23:50,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:23:50,826 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:50,850 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 00:23:51,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 934 states and 1237 transitions. [2019-11-20 00:23:51,044 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1237 transitions. [2019-11-20 00:23:51,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:23:51,046 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:51,082 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:23:51,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:51,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 936 states and 1239 transitions. [2019-11-20 00:23:51,563 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1239 transitions. [2019-11-20 00:23:51,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:23:51,565 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:51,603 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:23:51,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:51,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 937 states and 1239 transitions. [2019-11-20 00:23:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1239 transitions. [2019-11-20 00:23:51,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:23:51,724 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:51,759 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:23:52,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 938 states and 1239 transitions. [2019-11-20 00:23:52,026 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1239 transitions. [2019-11-20 00:23:52,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:23:52,028 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:23:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:52,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 939 states and 1240 transitions. [2019-11-20 00:23:52,578 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1240 transitions. [2019-11-20 00:23:52,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-20 00:23:52,580 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:53,156 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:23:57,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:57,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 958 states and 1270 transitions. [2019-11-20 00:23:57,820 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1270 transitions. [2019-11-20 00:23:57,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-20 00:23:57,821 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:57,848 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 00:23:58,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:23:58,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 960 states and 1273 transitions. [2019-11-20 00:23:58,650 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1273 transitions. [2019-11-20 00:23:58,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-20 00:23:58,651 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:23:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:23:58,676 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 00:24:00,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:00,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 973 states and 1294 transitions. [2019-11-20 00:24:00,542 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1294 transitions. [2019-11-20 00:24:00,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-20 00:24:00,543 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:00,573 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 00:24:01,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:01,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 975 states and 1297 transitions. [2019-11-20 00:24:01,121 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1297 transitions. [2019-11-20 00:24:01,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-20 00:24:01,122 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:01,148 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 00:24:01,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:01,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 976 states and 1297 transitions. [2019-11-20 00:24:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1297 transitions. [2019-11-20 00:24:01,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-20 00:24:01,169 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:01,384 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:24:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:02,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1046 states and 1371 transitions. [2019-11-20 00:24:02,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1371 transitions. [2019-11-20 00:24:02,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 00:24:02,906 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:02,946 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:24:04,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:04,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1062 states and 1390 transitions. [2019-11-20 00:24:04,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1390 transitions. [2019-11-20 00:24:04,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 00:24:04,326 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:04,385 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:24:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:04,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1063 states and 1391 transitions. [2019-11-20 00:24:04,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1391 transitions. [2019-11-20 00:24:04,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 00:24:04,406 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:24:04,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1065 states and 1392 transitions. [2019-11-20 00:24:04,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1392 transitions. [2019-11-20 00:24:04,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 00:24:04,717 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:04,756 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:24:05,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:05,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1072 states and 1399 transitions. [2019-11-20 00:24:05,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1399 transitions. [2019-11-20 00:24:05,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 00:24:05,271 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:05,305 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-20 00:24:05,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:05,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1074 states and 1400 transitions. [2019-11-20 00:24:05,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1400 transitions. [2019-11-20 00:24:05,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 00:24:05,802 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:05,831 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-20 00:24:06,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1075 states and 1400 transitions. [2019-11-20 00:24:06,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1400 transitions. [2019-11-20 00:24:06,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-20 00:24:06,090 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:06,179 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:24:07,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:07,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1086 states and 1414 transitions. [2019-11-20 00:24:07,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1414 transitions. [2019-11-20 00:24:07,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-20 00:24:07,142 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:07,657 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 95 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:24:11,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:11,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1101 states and 1434 transitions. [2019-11-20 00:24:11,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1434 transitions. [2019-11-20 00:24:11,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-20 00:24:11,517 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:11,728 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:24:11,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1102 states and 1435 transitions. [2019-11-20 00:24:11,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1435 transitions. [2019-11-20 00:24:11,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-20 00:24:11,750 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:24:19,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:19,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1169 states and 1507 transitions. [2019-11-20 00:24:19,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1507 transitions. [2019-11-20 00:24:19,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 00:24:19,220 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:20,940 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:24:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1278 states and 1631 transitions. [2019-11-20 00:24:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1631 transitions. [2019-11-20 00:24:31,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 00:24:31,442 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:31,549 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:24:33,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:33,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1292 states and 1646 transitions. [2019-11-20 00:24:33,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1646 transitions. [2019-11-20 00:24:33,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 00:24:33,098 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:33,189 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:24:34,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1318 states and 1671 transitions. [2019-11-20 00:24:34,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1671 transitions. [2019-11-20 00:24:34,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 00:24:34,858 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:34,996 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:24:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:35,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1320 states and 1673 transitions. [2019-11-20 00:24:35,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1673 transitions. [2019-11-20 00:24:35,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 00:24:35,508 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:35,559 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-11-20 00:24:38,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:38,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1345 states and 1703 transitions. [2019-11-20 00:24:38,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1703 transitions. [2019-11-20 00:24:38,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 00:24:38,594 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:38,624 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 00:24:38,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:38,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1356 states and 1715 transitions. [2019-11-20 00:24:38,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1715 transitions. [2019-11-20 00:24:38,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 00:24:38,682 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:38,715 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 00:24:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:41,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1377 states and 1743 transitions. [2019-11-20 00:24:41,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1743 transitions. [2019-11-20 00:24:41,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 00:24:41,039 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:41,085 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 00:24:41,407 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-11-20 00:24:41,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:41,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1382 states and 1748 transitions. [2019-11-20 00:24:41,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1748 transitions. [2019-11-20 00:24:41,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 00:24:41,789 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:41,829 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 00:24:42,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:42,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1388 states and 1755 transitions. [2019-11-20 00:24:42,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1755 transitions. [2019-11-20 00:24:42,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 00:24:42,317 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:42,360 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 00:24:42,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1389 states and 1755 transitions. [2019-11-20 00:24:42,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1755 transitions. [2019-11-20 00:24:42,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 00:24:42,577 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:43,410 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 109 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:24:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:47,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1418 states and 1792 transitions. [2019-11-20 00:24:47,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1792 transitions. [2019-11-20 00:24:47,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 00:24:47,657 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 109 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:24:48,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:48,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1421 states and 1794 transitions. [2019-11-20 00:24:48,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1794 transitions. [2019-11-20 00:24:48,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 00:24:48,414 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:48,501 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 109 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:24:49,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:49,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1428 states and 1801 transitions. [2019-11-20 00:24:49,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1801 transitions. [2019-11-20 00:24:49,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-20 00:24:49,900 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:49,931 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 00:24:49,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:49,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1429 states and 1802 transitions. [2019-11-20 00:24:49,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1802 transitions. [2019-11-20 00:24:49,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-20 00:24:49,958 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:49,993 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 00:24:50,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:50,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1430 states and 1804 transitions. [2019-11-20 00:24:50,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1804 transitions. [2019-11-20 00:24:50,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-20 00:24:50,027 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:50,139 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 00:24:50,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:50,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1434 states and 1809 transitions. [2019-11-20 00:24:50,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1809 transitions. [2019-11-20 00:24:50,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 00:24:50,640 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:50,684 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:24:52,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:52,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1451 states and 1831 transitions. [2019-11-20 00:24:52,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1831 transitions. [2019-11-20 00:24:52,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 00:24:52,953 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:53,532 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:24:54,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:54,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1457 states and 1838 transitions. [2019-11-20 00:24:54,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1838 transitions. [2019-11-20 00:24:54,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 00:24:54,796 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:54,897 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:24:56,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1522 states and 1902 transitions. [2019-11-20 00:24:56,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 1902 transitions. [2019-11-20 00:24:56,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 00:24:56,290 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:56,329 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:24:58,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:24:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1530 states and 1915 transitions. [2019-11-20 00:24:58,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 1915 transitions. [2019-11-20 00:24:58,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-20 00:24:58,850 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:24:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:24:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 00:25:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:00,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1536 states and 1926 transitions. [2019-11-20 00:25:00,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 1926 transitions. [2019-11-20 00:25:00,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-20 00:25:00,320 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:00,409 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:25:00,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:00,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1539 states and 1930 transitions. [2019-11-20 00:25:00,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 1930 transitions. [2019-11-20 00:25:00,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-20 00:25:00,932 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:00,988 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:25:03,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:03,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1556 states and 1951 transitions. [2019-11-20 00:25:03,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1951 transitions. [2019-11-20 00:25:03,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-20 00:25:03,216 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:03,268 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:25:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:04,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1561 states and 1956 transitions. [2019-11-20 00:25:04,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1956 transitions. [2019-11-20 00:25:04,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-20 00:25:04,298 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:04,334 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-20 00:25:04,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:04,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1568 states and 1964 transitions. [2019-11-20 00:25:04,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 1964 transitions. [2019-11-20 00:25:04,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-20 00:25:04,933 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:05,347 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 00:25:06,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:06,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1573 states and 1971 transitions. [2019-11-20 00:25:06,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1971 transitions. [2019-11-20 00:25:06,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-20 00:25:06,654 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:06,723 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:25:08,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1583 states and 1986 transitions. [2019-11-20 00:25:08,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 1986 transitions. [2019-11-20 00:25:08,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-20 00:25:08,410 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:09,642 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 98 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:25:11,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:11,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1589 states and 1994 transitions. [2019-11-20 00:25:11,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 1994 transitions. [2019-11-20 00:25:11,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-20 00:25:11,816 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:25:15,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:15,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 1605 states and 2020 transitions. [2019-11-20 00:25:15,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2020 transitions. [2019-11-20 00:25:15,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-20 00:25:15,797 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:16,189 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:25:19,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:19,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 1617 states and 2042 transitions. [2019-11-20 00:25:19,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2042 transitions. [2019-11-20 00:25:19,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-20 00:25:19,899 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:25:21,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:21,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 1621 states and 2046 transitions. [2019-11-20 00:25:21,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 2046 transitions. [2019-11-20 00:25:21,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-20 00:25:21,168 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:21,212 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 00:25:21,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:21,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 1626 states and 2054 transitions. [2019-11-20 00:25:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 2054 transitions. [2019-11-20 00:25:21,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-20 00:25:21,572 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:21,618 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 00:25:24,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 1641 states and 2076 transitions. [2019-11-20 00:25:24,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2076 transitions. [2019-11-20 00:25:24,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-20 00:25:24,949 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 00:25:25,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:25,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 1643 states and 2077 transitions. [2019-11-20 00:25:25,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2077 transitions. [2019-11-20 00:25:25,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-20 00:25:25,395 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:25,435 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 00:25:26,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:26,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 1647 states and 2082 transitions. [2019-11-20 00:25:26,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2082 transitions. [2019-11-20 00:25:26,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-20 00:25:26,930 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:26,972 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-20 00:25:28,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:28,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 1652 states and 2089 transitions. [2019-11-20 00:25:28,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2089 transitions. [2019-11-20 00:25:28,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-20 00:25:28,088 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-20 00:25:30,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 1657 states and 2101 transitions. [2019-11-20 00:25:30,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2101 transitions. [2019-11-20 00:25:30,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-20 00:25:30,114 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:30,164 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:25:31,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:31,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 1664 states and 2109 transitions. [2019-11-20 00:25:31,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2109 transitions. [2019-11-20 00:25:31,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-20 00:25:31,159 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:31,203 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 00:25:33,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:33,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 1696 states and 2144 transitions. [2019-11-20 00:25:33,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2144 transitions. [2019-11-20 00:25:33,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-20 00:25:33,999 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:34,054 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 00:25:36,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:36,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 1706 states and 2158 transitions. [2019-11-20 00:25:36,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2158 transitions. [2019-11-20 00:25:36,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-20 00:25:36,601 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:36,660 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 00:25:37,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:37,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 1707 states and 2161 transitions. [2019-11-20 00:25:37,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2161 transitions. [2019-11-20 00:25:37,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-20 00:25:37,131 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:37,240 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 00:25:39,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:39,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 1717 states and 2168 transitions. [2019-11-20 00:25:39,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2168 transitions. [2019-11-20 00:25:39,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-20 00:25:39,431 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:39,491 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 00:25:40,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:40,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 1719 states and 2171 transitions. [2019-11-20 00:25:40,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2171 transitions. [2019-11-20 00:25:40,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-20 00:25:40,676 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:40,718 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-20 00:25:41,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:41,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2190 states to 1738 states and 2190 transitions. [2019-11-20 00:25:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2190 transitions. [2019-11-20 00:25:41,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-20 00:25:41,070 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:41,117 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-20 00:25:44,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:44,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 1747 states and 2206 transitions. [2019-11-20 00:25:44,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2206 transitions. [2019-11-20 00:25:44,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-20 00:25:44,327 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:44,371 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-20 00:25:45,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:45,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 1748 states and 2208 transitions. [2019-11-20 00:25:45,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2208 transitions. [2019-11-20 00:25:45,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-20 00:25:45,080 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-20 00:25:45,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:45,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 1749 states and 2208 transitions. [2019-11-20 00:25:45,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2208 transitions. [2019-11-20 00:25:45,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-20 00:25:45,747 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:45,784 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-20 00:25:47,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:47,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 1754 states and 2214 transitions. [2019-11-20 00:25:47,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2214 transitions. [2019-11-20 00:25:47,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-20 00:25:47,149 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:47,192 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:25:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:52,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 1776 states and 2242 transitions. [2019-11-20 00:25:52,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2242 transitions. [2019-11-20 00:25:52,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-20 00:25:52,512 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:52,554 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:25:54,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:54,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 1783 states and 2250 transitions. [2019-11-20 00:25:54,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2250 transitions. [2019-11-20 00:25:54,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-20 00:25:54,143 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:54,184 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:25:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:54,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 1784 states and 2250 transitions. [2019-11-20 00:25:54,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2250 transitions. [2019-11-20 00:25:54,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-20 00:25:54,960 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:25:55,045 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-20 00:25:59,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:25:59,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 1811 states and 2280 transitions. [2019-11-20 00:25:59,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2280 transitions. [2019-11-20 00:25:59,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-20 00:25:59,864 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:25:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:26:00,123 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-20 00:26:03,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:26:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2297 states to 1820 states and 2297 transitions. [2019-11-20 00:26:03,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2297 transitions. [2019-11-20 00:26:03,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-20 00:26:03,907 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:26:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:26:04,092 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-20 00:26:04,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:26:04,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 1821 states and 2299 transitions. [2019-11-20 00:26:04,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2299 transitions. [2019-11-20 00:26:04,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-20 00:26:04,870 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:26:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:26:04,989 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-20 00:26:06,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:26:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 1829 states and 2308 transitions. [2019-11-20 00:26:06,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2308 transitions. [2019-11-20 00:26:06,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-20 00:26:06,713 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:26:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:26:06,867 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-20 00:26:09,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:26:09,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 1839 states and 2319 transitions. [2019-11-20 00:26:09,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2319 transitions. [2019-11-20 00:26:09,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 00:26:09,360 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:26:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:26:09,425 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 193 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-20 00:26:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:26:10,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 1844 states and 2325 transitions. [2019-11-20 00:26:10,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2325 transitions. [2019-11-20 00:26:10,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 00:26:10,370 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:26:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:26:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 00:26:19,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:26:19,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 1878 states and 2361 transitions. [2019-11-20 00:26:19,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2361 transitions. [2019-11-20 00:26:19,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 00:26:19,609 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:26:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:26:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 00:26:23,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:26:23,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 1893 states and 2376 transitions. [2019-11-20 00:26:23,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2376 transitions. [2019-11-20 00:26:23,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 00:26:23,647 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:26:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:26:23,846 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 00:26:25,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:26:25,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 1898 states and 2381 transitions. [2019-11-20 00:26:25,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2381 transitions. [2019-11-20 00:26:25,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 00:26:25,157 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:26:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:26:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:26:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:26:25,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 1903 states and 2385 transitions. [2019-11-20 00:26:25,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 2385 transitions. [2019-11-20 00:26:25,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-20 00:26:25,839 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:26:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:26:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-20 00:26:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:26:27,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 1931 states and 2417 transitions. [2019-11-20 00:26:27,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2417 transitions. [2019-11-20 00:26:27,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-20 00:26:27,786 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:26:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:26:28,177 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:26:29,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:26:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 1936 states and 2424 transitions. [2019-11-20 00:26:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2424 transitions. [2019-11-20 00:26:29,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-20 00:26:29,494 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:26:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:26:30,786 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 170 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:26:36,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:26:36,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 1990 states and 2486 transitions. [2019-11-20 00:26:36,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 2486 transitions. [2019-11-20 00:26:36,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-20 00:26:36,489 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:26:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:26:36,540 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:26:38,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:26:38,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2002 states and 2506 transitions. [2019-11-20 00:26:38,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 2506 transitions. [2019-11-20 00:26:38,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-20 00:26:38,120 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:26:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:26:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:26:38,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:26:38,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2007 states and 2511 transitions. [2019-11-20 00:26:38,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2511 transitions. [2019-11-20 00:26:38,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-20 00:26:38,922 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:26:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:26:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:26:41,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:26:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2017 states and 2521 transitions. [2019-11-20 00:26:41,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2521 transitions. [2019-11-20 00:26:41,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-20 00:26:41,081 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:26:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:26:41,128 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:26:42,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:26:42,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2527 states to 2024 states and 2527 transitions. [2019-11-20 00:26:42,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2527 transitions. [2019-11-20 00:26:42,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-20 00:26:42,843 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:26:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:26:45,805 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:26:54,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:26:54,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2061 states and 2568 transitions. [2019-11-20 00:26:54,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 2568 transitions. [2019-11-20 00:26:54,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-20 00:26:54,164 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:26:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:26:54,393 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:27:01,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:27:01,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2596 states to 2090 states and 2596 transitions. [2019-11-20 00:27:01,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 2596 transitions. [2019-11-20 00:27:01,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-20 00:27:01,708 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:27:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:27:01,933 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:27:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:27:02,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2601 states to 2095 states and 2601 transitions. [2019-11-20 00:27:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 2601 transitions. [2019-11-20 00:27:02,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-20 00:27:02,582 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:27:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:27:02,635 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-11-20 00:27:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:27:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2632 states to 2120 states and 2632 transitions. [2019-11-20 00:27:07,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 2632 transitions. [2019-11-20 00:27:07,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-20 00:27:07,847 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:27:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:27:08,299 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 00:27:15,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:27:15,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2707 states to 2190 states and 2707 transitions. [2019-11-20 00:27:15,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 2707 transitions. [2019-11-20 00:27:15,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-20 00:27:15,717 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:27:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:27:18,464 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:27:22,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:27:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2200 states and 2718 transitions. [2019-11-20 00:27:22,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 2718 transitions. [2019-11-20 00:27:22,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-20 00:27:22,310 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:27:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:27:22,925 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:27:24,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:27:24,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2203 states and 2722 transitions. [2019-11-20 00:27:24,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 2722 transitions. [2019-11-20 00:27:24,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-20 00:27:24,350 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:27:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:27:24,486 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 116 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-20 00:27:25,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:27:25,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2204 states and 2726 transitions. [2019-11-20 00:27:25,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2204 states and 2726 transitions. [2019-11-20 00:27:25,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-20 00:27:25,616 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:27:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:27:28,642 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 00:27:29,490 WARN L191 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-11-20 00:27:37,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:27:37,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2232 states and 2761 transitions. [2019-11-20 00:27:37,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 2761 transitions. [2019-11-20 00:27:37,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-20 00:27:37,085 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:27:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:27:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 00:27:41,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:27:41,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2780 states to 2252 states and 2780 transitions. [2019-11-20 00:27:41,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 2780 transitions. [2019-11-20 00:27:41,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-20 00:27:41,039 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:27:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:27:41,241 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 00:27:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:27:43,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2259 states and 2786 transitions. [2019-11-20 00:27:43,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 2786 transitions. [2019-11-20 00:27:43,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-20 00:27:43,004 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:27:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:27:43,239 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 00:27:44,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:27:44,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2787 states to 2260 states and 2787 transitions. [2019-11-20 00:27:44,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 2787 transitions. [2019-11-20 00:27:44,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-20 00:27:44,332 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:27:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:27:44,911 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 00:27:48,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:27:48,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2794 states to 2269 states and 2794 transitions. [2019-11-20 00:27:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2269 states and 2794 transitions. [2019-11-20 00:27:48,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-20 00:27:48,090 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:27:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:27:48,269 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 00:27:48,619 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-11-20 00:27:49,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:27:49,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2795 states to 2271 states and 2795 transitions. [2019-11-20 00:27:49,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 2795 transitions. [2019-11-20 00:27:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-11-20 00:27:49,139 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:27:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:27:49,210 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-20 00:27:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:27:55,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2296 states and 2828 transitions. [2019-11-20 00:27:55,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 2828 transitions. [2019-11-20 00:27:55,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-11-20 00:27:55,073 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:27:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:27:55,141 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-20 00:27:58,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:27:58,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2308 states and 2840 transitions. [2019-11-20 00:27:58,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 2840 transitions. [2019-11-20 00:27:58,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-11-20 00:27:58,457 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:27:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:27:58,543 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-20 00:27:58,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:27:58,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2310 states and 2841 transitions. [2019-11-20 00:27:58,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 2841 transitions. [2019-11-20 00:27:58,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-11-20 00:27:58,607 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:27:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:27:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-20 00:27:59,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:27:59,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2312 states and 2845 transitions. [2019-11-20 00:27:59,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2845 transitions. [2019-11-20 00:27:59,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-11-20 00:27:59,202 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:27:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:27:59,278 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-20 00:28:01,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:28:01,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2847 states to 2315 states and 2847 transitions. [2019-11-20 00:28:01,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 2847 transitions. [2019-11-20 00:28:01,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 00:28:01,704 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:28:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:28:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-20 00:28:05,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:28:05,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2864 states to 2330 states and 2864 transitions. [2019-11-20 00:28:05,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2330 states and 2864 transitions. [2019-11-20 00:28:05,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 00:28:05,397 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:28:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:28:05,482 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-20 00:28:09,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:28:09,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2364 states and 2898 transitions. [2019-11-20 00:28:09,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 2898 transitions. [2019-11-20 00:28:09,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 00:28:09,660 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:28:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:28:09,755 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-20 00:28:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:28:12,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2378 states and 2915 transitions. [2019-11-20 00:28:12,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 2915 transitions. [2019-11-20 00:28:12,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 00:28:12,037 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:28:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:28:12,130 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-20 00:28:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:28:14,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2391 states and 2930 transitions. [2019-11-20 00:28:14,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 2930 transitions. [2019-11-20 00:28:14,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 00:28:14,278 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:28:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:28:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-20 00:28:15,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:28:15,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2935 states to 2397 states and 2935 transitions. [2019-11-20 00:28:15,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 2935 transitions. [2019-11-20 00:28:15,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 00:28:15,278 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:28:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:28:15,369 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-20 00:28:20,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:28:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2960 states to 2416 states and 2960 transitions. [2019-11-20 00:28:20,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 2960 transitions. [2019-11-20 00:28:20,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 00:28:20,761 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:28:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:28:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-20 00:28:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:28:22,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2963 states to 2418 states and 2963 transitions. [2019-11-20 00:28:22,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 2963 transitions. [2019-11-20 00:28:22,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 00:28:22,274 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:28:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:28:22,364 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-20 00:28:23,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:28:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 2420 states and 2964 transitions. [2019-11-20 00:28:23,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 2964 transitions. [2019-11-20 00:28:23,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 00:28:23,427 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:28:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:28:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-20 00:28:24,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:28:24,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2421 states and 2965 transitions. [2019-11-20 00:28:24,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 2965 transitions. [2019-11-20 00:28:24,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 00:28:24,584 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:28:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:28:24,718 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-20 00:28:28,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:28:28,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2970 states to 2426 states and 2970 transitions. [2019-11-20 00:28:28,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 2970 transitions. [2019-11-20 00:28:28,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 00:28:28,279 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:28:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:28:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-20 00:28:29,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:28:29,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2428 states and 2971 transitions. [2019-11-20 00:28:29,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 2971 transitions. [2019-11-20 00:28:29,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 00:28:29,467 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:28:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:28:29,558 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-20 00:28:30,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:28:30,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2432 states and 2974 transitions. [2019-11-20 00:28:30,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 2974 transitions. [2019-11-20 00:28:30,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 00:28:30,911 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:28:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:28:31,002 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-20 00:28:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:28:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2434 states and 2975 transitions. [2019-11-20 00:28:32,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 2975 transitions. [2019-11-20 00:28:32,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 00:28:32,598 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:28:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:28:32,740 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 00:28:34,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:28:34,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2980 states to 2438 states and 2980 transitions. [2019-11-20 00:28:34,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2438 states and 2980 transitions. [2019-11-20 00:28:34,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-20 00:28:34,052 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:28:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:28:35,120 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 278 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-20 00:28:41,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:28:41,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 2449 states and 3002 transitions. [2019-11-20 00:28:41,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 3002 transitions. [2019-11-20 00:28:41,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-20 00:28:41,096 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:28:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:28:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 250 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-20 00:28:42,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:28:42,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 2452 states and 3008 transitions. [2019-11-20 00:28:42,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 3008 transitions. [2019-11-20 00:28:42,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-20 00:28:42,491 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:28:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:28:42,694 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 250 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-20 00:28:43,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:28:43,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 2453 states and 3008 transitions. [2019-11-20 00:28:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 3008 transitions. [2019-11-20 00:28:43,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-20 00:28:43,633 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:28:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:28:43,834 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 250 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-20 00:28:45,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:28:45,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 2455 states and 3012 transitions. [2019-11-20 00:28:45,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2455 states and 3012 transitions. [2019-11-20 00:28:45,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-20 00:28:45,251 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:28:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:28:45,400 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 250 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-20 00:28:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:28:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 2456 states and 3012 transitions. [2019-11-20 00:28:45,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 3012 transitions. [2019-11-20 00:28:45,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-20 00:28:45,897 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:28:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:28:45,983 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 00:28:48,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:28:48,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 2465 states and 3022 transitions. [2019-11-20 00:28:48,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3022 transitions. [2019-11-20 00:28:48,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-20 00:28:48,095 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:28:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:28:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 00:28:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:28:49,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 2475 states and 3031 transitions. [2019-11-20 00:28:49,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3031 transitions. [2019-11-20 00:28:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-20 00:28:49,662 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:28:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:28:51,820 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 71 proven. 187 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-20 00:28:57,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:28:57,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3056 states to 2490 states and 3056 transitions. [2019-11-20 00:28:57,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 3056 transitions. [2019-11-20 00:28:57,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-11-20 00:28:57,916 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:28:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:28:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 00:29:03,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:29:03,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 2521 states and 3094 transitions. [2019-11-20 00:29:03,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 3094 transitions. [2019-11-20 00:29:03,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-11-20 00:29:03,772 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:29:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 00:29:04,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:29:04,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3101 states to 2530 states and 3101 transitions. [2019-11-20 00:29:04,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2530 states and 3101 transitions. [2019-11-20 00:29:04,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-11-20 00:29:04,154 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:29:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:04,247 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 00:29:04,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:29:04,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3101 states to 2531 states and 3101 transitions. [2019-11-20 00:29:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 3101 transitions. [2019-11-20 00:29:04,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-11-20 00:29:04,785 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:29:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:05,412 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 00:29:05,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:29:05,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3101 states to 2532 states and 3101 transitions. [2019-11-20 00:29:05,940 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 3101 transitions. [2019-11-20 00:29:05,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-11-20 00:29:05,942 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:29:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:08,989 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-20 00:29:33,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:29:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 2584 states and 3183 transitions. [2019-11-20 00:29:33,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2584 states and 3183 transitions. [2019-11-20 00:29:33,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-11-20 00:29:33,412 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:29:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:33,557 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-20 00:29:36,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:29:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 2594 states and 3190 transitions. [2019-11-20 00:29:36,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 3190 transitions. [2019-11-20 00:29:36,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-11-20 00:29:36,363 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:29:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:36,512 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-20 00:29:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:29:37,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 2596 states and 3191 transitions. [2019-11-20 00:29:37,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2596 states and 3191 transitions. [2019-11-20 00:29:37,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-20 00:29:37,318 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:29:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:37,494 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-11-20 00:29:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:29:48,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3274 states to 2647 states and 3274 transitions. [2019-11-20 00:29:48,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 3274 transitions. [2019-11-20 00:29:48,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-20 00:29:48,121 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:29:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:48,299 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-11-20 00:29:52,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:29:52,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3309 states to 2672 states and 3309 transitions. [2019-11-20 00:29:52,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2672 states and 3309 transitions. [2019-11-20 00:29:52,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-20 00:29:52,436 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:29:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:52,641 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-11-20 00:29:56,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:29:56,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3322 states to 2687 states and 3322 transitions. [2019-11-20 00:29:56,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 3322 transitions. [2019-11-20 00:29:56,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-20 00:29:56,957 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:29:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:57,134 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-11-20 00:29:58,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:29:58,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3346 states to 2707 states and 3346 transitions. [2019-11-20 00:29:58,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2707 states and 3346 transitions. [2019-11-20 00:29:58,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-20 00:29:58,391 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:29:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:29:58,568 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-11-20 00:30:00,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:30:00,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3353 states to 2713 states and 3353 transitions. [2019-11-20 00:30:00,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 3353 transitions. [2019-11-20 00:30:00,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-20 00:30:00,261 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:30:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:30:00,438 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-11-20 00:30:04,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:30:04,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3366 states to 2723 states and 3366 transitions. [2019-11-20 00:30:04,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3366 transitions. [2019-11-20 00:30:04,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-20 00:30:04,261 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:30:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:30:04,438 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-11-20 00:30:05,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:30:05,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 2727 states and 3370 transitions. [2019-11-20 00:30:05,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2727 states and 3370 transitions. [2019-11-20 00:30:05,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-20 00:30:05,577 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:30:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:30:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-11-20 00:30:06,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:30:06,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 2728 states and 3370 transitions. [2019-11-20 00:30:06,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2728 states and 3370 transitions. [2019-11-20 00:30:06,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-20 00:30:06,957 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:30:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:30:07,133 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-11-20 00:30:08,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:30:08,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3372 states to 2729 states and 3372 transitions. [2019-11-20 00:30:08,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2729 states and 3372 transitions. [2019-11-20 00:30:08,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-11-20 00:30:08,387 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:30:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:30:12,117 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-20 00:30:19,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:30:19,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 2749 states and 3394 transitions. [2019-11-20 00:30:19,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2749 states and 3394 transitions. [2019-11-20 00:30:19,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-11-20 00:30:19,524 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:30:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:30:22,431 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 375 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-20 00:30:39,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:30:39,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 2788 states and 3449 transitions. [2019-11-20 00:30:39,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 3449 transitions. [2019-11-20 00:30:39,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-20 00:30:39,140 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:30:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:30:39,264 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-20 00:30:41,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:30:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3463 states to 2803 states and 3463 transitions. [2019-11-20 00:30:41,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2803 states and 3463 transitions. [2019-11-20 00:30:41,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-20 00:30:41,603 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:30:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:30:41,763 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-20 00:30:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:30:47,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3487 states to 2827 states and 3487 transitions. [2019-11-20 00:30:47,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 3487 transitions. [2019-11-20 00:30:47,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-20 00:30:47,409 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:30:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:30:47,583 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-20 00:30:49,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:30:49,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3492 states to 2832 states and 3492 transitions. [2019-11-20 00:30:49,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2832 states and 3492 transitions. [2019-11-20 00:30:49,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-20 00:30:49,632 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:30:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:30:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-20 00:30:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:30:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3505 states to 2845 states and 3505 transitions. [2019-11-20 00:30:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 3505 transitions. [2019-11-20 00:30:52,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-20 00:30:52,642 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:30:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:30:52,759 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-20 00:30:55,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:30:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3517 states to 2857 states and 3517 transitions. [2019-11-20 00:30:55,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 3517 transitions. [2019-11-20 00:30:55,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-11-20 00:30:55,759 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:30:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:30:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-20 00:31:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:31:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 2863 states and 3532 transitions. [2019-11-20 00:31:00,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2863 states and 3532 transitions. [2019-11-20 00:31:00,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-11-20 00:31:00,527 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:31:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:00,646 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-11-20 00:31:10,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:31:10,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 2889 states and 3564 transitions. [2019-11-20 00:31:10,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 3564 transitions. [2019-11-20 00:31:10,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-11-20 00:31:10,648 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:31:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:10,771 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-11-20 00:31:14,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:31:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 2894 states and 3573 transitions. [2019-11-20 00:31:14,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2894 states and 3573 transitions. [2019-11-20 00:31:14,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-11-20 00:31:14,868 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:31:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:15,022 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-11-20 00:31:18,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:31:18,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 2908 states and 3584 transitions. [2019-11-20 00:31:18,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2908 states and 3584 transitions. [2019-11-20 00:31:18,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-11-20 00:31:18,940 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:31:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-11-20 00:31:20,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:31:20,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 2910 states and 3584 transitions. [2019-11-20 00:31:20,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 3584 transitions. [2019-11-20 00:31:20,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-11-20 00:31:20,968 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:31:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:21,088 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-11-20 00:31:21,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:31:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 2917 states and 3590 transitions. [2019-11-20 00:31:21,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 3590 transitions. [2019-11-20 00:31:21,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-11-20 00:31:21,243 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:31:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:21,362 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-11-20 00:31:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:31:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3596 states to 2924 states and 3596 transitions. [2019-11-20 00:31:22,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 3596 transitions. [2019-11-20 00:31:22,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-11-20 00:31:22,680 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:31:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:22,872 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-11-20 00:31:35,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:31:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 2985 states and 3668 transitions. [2019-11-20 00:31:35,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2985 states and 3668 transitions. [2019-11-20 00:31:35,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-11-20 00:31:35,282 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:31:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:35,474 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-11-20 00:31:43,674 WARN L191 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 24 [2019-11-20 00:31:44,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:31:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3708 states to 3020 states and 3708 transitions. [2019-11-20 00:31:44,818 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 3708 transitions. [2019-11-20 00:31:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-11-20 00:31:44,821 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:31:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:45,023 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-11-20 00:31:47,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:31:47,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3024 states and 3713 transitions. [2019-11-20 00:31:47,430 INFO L276 IsEmpty]: Start isEmpty. Operand 3024 states and 3713 transitions. [2019-11-20 00:31:47,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-11-20 00:31:47,432 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:31:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:47,636 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-11-20 00:31:48,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:31:48,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3718 states to 3030 states and 3718 transitions. [2019-11-20 00:31:48,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3718 transitions. [2019-11-20 00:31:48,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-11-20 00:31:48,320 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:31:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-11-20 00:31:51,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:31:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3726 states to 3039 states and 3726 transitions. [2019-11-20 00:31:51,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3039 states and 3726 transitions. [2019-11-20 00:31:51,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-11-20 00:31:51,678 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:31:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:31:52,141 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 255 iterations. [2019-11-20 00:31:52,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 20.11 12:31:52 ImpRootNode [2019-11-20 00:31:52,499 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-11-20 00:31:52,499 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:31:52,499 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:31:52,500 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:31:52,500 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:22:38" (3/4) ... [2019-11-20 00:31:52,503 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 00:31:52,722 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b0af59ff-dfca-4d01-8c09-5aaba0bf03b6/bin/ukojak/witness.graphml [2019-11-20 00:31:52,722 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:31:52,723 INFO L168 Benchmark]: Toolchain (without parser) took 556677.00 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 940.7 MB in the beginning and 1.8 GB in the end (delta: -835.9 MB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-11-20 00:31:52,724 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:31:52,724 INFO L168 Benchmark]: CACSL2BoogieTranslator took 620.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2019-11-20 00:31:52,725 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-20 00:31:52,725 INFO L168 Benchmark]: Boogie Preprocessor took 96.75 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: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. [2019-11-20 00:31:52,726 INFO L168 Benchmark]: RCFGBuilder took 1939.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 881.4 MB in the end (delta: 210.1 MB). Peak memory consumption was 210.1 MB. Max. memory is 11.5 GB. [2019-11-20 00:31:52,726 INFO L168 Benchmark]: CodeCheck took 553710.73 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 880.1 MB in the beginning and 1.8 GB in the end (delta: -917.1 MB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-11-20 00:31:52,726 INFO L168 Benchmark]: Witness Printer took 222.79 ms. Allocated memory is still 4.6 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-20 00:31:52,729 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: UNSAFE, OverallTime: 553.3s, OverallIterations: 255, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1049108668 SDtfs, 1666308190 SDslu, 1999697022 SDs, 0 SdLazy, 1825556512 SolverSat, -2041311132 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1717.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 275076 GetRequests, 265918 SyntacticMatches, 6464 SemanticMatches, 2694 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5283480 ImplicationChecksByTransitivity, 505.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 1.8s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 44.6s InterpolantComputationTime, 40814 NumberOfCodeBlocks, 40814 NumberOfCodeBlocksAsserted, 255 NumberOfCheckSat, 40298 ConstructedInterpolants, 0 QuantifiedInterpolants, 27910092 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 254 InterpolantComputations, 209 PerfectInterpolantSequences, 36491/36950 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 395]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND TRUE ((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))) [L149] a16 = 4 [L150] a17 = 0 [L151] return 25; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND TRUE ((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1))) [L232] a8 = 14 [L233] a7 = 0 [L234] a17 = 1 [L235] a21 = 1 [L236] a16 = 4 [L237] return -1; VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND TRUE (((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L395] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 620.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 96.75 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: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1939.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 881.4 MB in the end (delta: 210.1 MB). Peak memory consumption was 210.1 MB. Max. memory is 11.5 GB. * CodeCheck took 553710.73 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 880.1 MB in the beginning and 1.8 GB in the end (delta: -917.1 MB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Witness Printer took 222.79 ms. Allocated memory is still 4.6 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...