./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label38_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_136186f1-92b8-4045-a404-89b05683c55f/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_136186f1-92b8-4045-a404-89b05683c55f/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_136186f1-92b8-4045-a404-89b05683c55f/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_136186f1-92b8-4045-a404-89b05683c55f/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label38_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_136186f1-92b8-4045-a404-89b05683c55f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_136186f1-92b8-4045-a404-89b05683c55f/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5d9bfdaf23db32516d1ccf8929c6af5e4a9d3bd0 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 00:34:03,550 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 00:34:03,552 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 00:34:03,561 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 00:34:03,561 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 00:34:03,562 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 00:34:03,563 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 00:34:03,564 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 00:34:03,566 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 00:34:03,566 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 00:34:03,567 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 00:34:03,567 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 00:34:03,568 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 00:34:03,569 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 00:34:03,570 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 00:34:03,570 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 00:34:03,571 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 00:34:03,572 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 00:34:03,574 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 00:34:03,575 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 00:34:03,576 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 00:34:03,577 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 00:34:03,578 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 00:34:03,579 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 00:34:03,579 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 00:34:03,579 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 00:34:03,580 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 00:34:03,581 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 00:34:03,582 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 00:34:03,583 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 00:34:03,583 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 00:34:03,583 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 00:34:03,583 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 00:34:03,584 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 00:34:03,585 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 00:34:03,586 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 00:34:03,586 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_136186f1-92b8-4045-a404-89b05683c55f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-27 00:34:03,601 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 00:34:03,602 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 00:34:03,603 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 00:34:03,605 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-27 00:34:03,606 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 00:34:03,606 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 00:34:03,606 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 00:34:03,606 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 00:34:03,606 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 00:34:03,606 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 00:34:03,607 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 00:34:03,607 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 00:34:03,607 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 00:34:03,607 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 00:34:03,607 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 00:34:03,607 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 00:34:03,607 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 00:34:03,607 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-27 00:34:03,607 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-27 00:34:03,608 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 00:34:03,608 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 00:34:03,608 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-27 00:34:03,608 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 00:34:03,608 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 00:34:03,608 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 00:34:03,608 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-27 00:34:03,608 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 00:34:03,609 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 00:34:03,609 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_136186f1-92b8-4045-a404-89b05683c55f/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5d9bfdaf23db32516d1ccf8929c6af5e4a9d3bd0 [2018-10-27 00:34:03,645 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 00:34:03,654 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 00:34:03,657 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 00:34:03,658 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 00:34:03,659 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 00:34:03,659 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_136186f1-92b8-4045-a404-89b05683c55f/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label38_false-unreach-call_false-termination.c [2018-10-27 00:34:03,708 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_136186f1-92b8-4045-a404-89b05683c55f/bin-2019/ukojak/data/6bba3a18f/e999499acfa74b6a957a0b151cd726f2/FLAGca1054c58 [2018-10-27 00:34:04,152 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 00:34:04,152 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_136186f1-92b8-4045-a404-89b05683c55f/sv-benchmarks/c/eca-rers2012/Problem01_label38_false-unreach-call_false-termination.c [2018-10-27 00:34:04,167 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_136186f1-92b8-4045-a404-89b05683c55f/bin-2019/ukojak/data/6bba3a18f/e999499acfa74b6a957a0b151cd726f2/FLAGca1054c58 [2018-10-27 00:34:04,181 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_136186f1-92b8-4045-a404-89b05683c55f/bin-2019/ukojak/data/6bba3a18f/e999499acfa74b6a957a0b151cd726f2 [2018-10-27 00:34:04,183 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 00:34:04,184 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 00:34:04,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 00:34:04,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 00:34:04,188 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 00:34:04,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:34:04" (1/1) ... [2018-10-27 00:34:04,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23ca6835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:04, skipping insertion in model container [2018-10-27 00:34:04,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:34:04" (1/1) ... [2018-10-27 00:34:04,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 00:34:04,241 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 00:34:04,555 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:34:04,558 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 00:34:04,653 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:34:04,665 INFO L193 MainTranslator]: Completed translation [2018-10-27 00:34:04,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:04 WrapperNode [2018-10-27 00:34:04,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 00:34:04,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 00:34:04,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 00:34:04,667 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 00:34:04,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:04" (1/1) ... [2018-10-27 00:34:04,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:04" (1/1) ... [2018-10-27 00:34:04,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 00:34:04,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 00:34:04,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 00:34:04,913 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 00:34:04,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:04" (1/1) ... [2018-10-27 00:34:04,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:04" (1/1) ... [2018-10-27 00:34:04,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:04" (1/1) ... [2018-10-27 00:34:04,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:04" (1/1) ... [2018-10-27 00:34:04,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:04" (1/1) ... [2018-10-27 00:34:04,969 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:04" (1/1) ... [2018-10-27 00:34:04,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:04" (1/1) ... [2018-10-27 00:34:04,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 00:34:04,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 00:34:04,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 00:34:04,982 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 00:34:04,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_136186f1-92b8-4045-a404-89b05683c55f/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-27 00:34:05,042 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-27 00:34:05,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 00:34:05,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 00:34:10,150 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 00:34:10,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:34:10 BoogieIcfgContainer [2018-10-27 00:34:10,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 00:34:10,152 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-27 00:34:10,152 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-27 00:34:10,162 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-27 00:34:10,162 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:34:10" (1/1) ... [2018-10-27 00:34:10,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:34:10,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:10,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-10-27 00:34:10,226 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-10-27 00:34:10,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-27 00:34:10,231 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:11,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 147 states and 234 transitions. [2018-10-27 00:34:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 234 transitions. [2018-10-27 00:34:11,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-27 00:34:11,408 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:11,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:12,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:12,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 212 states and 322 transitions. [2018-10-27 00:34:12,189 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 322 transitions. [2018-10-27 00:34:12,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-27 00:34:12,191 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:12,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:12,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:12,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 217 states and 330 transitions. [2018-10-27 00:34:12,521 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 330 transitions. [2018-10-27 00:34:12,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-27 00:34:12,523 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:12,847 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:13,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 288 states and 404 transitions. [2018-10-27 00:34:13,360 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 404 transitions. [2018-10-27 00:34:13,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-27 00:34:13,362 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:13,386 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:34:13,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 289 states and 405 transitions. [2018-10-27 00:34:13,528 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 405 transitions. [2018-10-27 00:34:13,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-27 00:34:13,532 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:13,611 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 00:34:13,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:13,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 302 states and 425 transitions. [2018-10-27 00:34:13,976 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 425 transitions. [2018-10-27 00:34:13,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-27 00:34:13,977 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:14,147 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:14,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:14,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 317 states and 443 transitions. [2018-10-27 00:34:14,694 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 443 transitions. [2018-10-27 00:34:14,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-27 00:34:14,695 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:15,187 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 00:34:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:15,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 326 states and 456 transitions. [2018-10-27 00:34:15,534 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 456 transitions. [2018-10-27 00:34:15,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-27 00:34:15,535 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:15,561 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 00:34:15,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:15,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 329 states and 459 transitions. [2018-10-27 00:34:15,715 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 459 transitions. [2018-10-27 00:34:15,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-27 00:34:15,716 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:15,740 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:16,146 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 00:34:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 333 states and 464 transitions. [2018-10-27 00:34:16,440 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 464 transitions. [2018-10-27 00:34:16,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-27 00:34:16,441 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:16,584 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:17,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:17,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 349 states and 486 transitions. [2018-10-27 00:34:17,146 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 486 transitions. [2018-10-27 00:34:17,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-27 00:34:17,147 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:18,609 WARN L179 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2018-10-27 00:34:18,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:18,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 356 states and 495 transitions. [2018-10-27 00:34:18,738 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 495 transitions. [2018-10-27 00:34:18,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-27 00:34:18,739 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:18,770 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 00:34:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 361 states and 500 transitions. [2018-10-27 00:34:18,836 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 500 transitions. [2018-10-27 00:34:18,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-27 00:34:18,837 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:18,864 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 00:34:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:19,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 366 states and 506 transitions. [2018-10-27 00:34:19,393 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 506 transitions. [2018-10-27 00:34:19,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-27 00:34:19,393 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:20,324 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:20,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:20,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 384 states and 526 transitions. [2018-10-27 00:34:20,619 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 526 transitions. [2018-10-27 00:34:20,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-27 00:34:20,619 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:20,641 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:20,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:20,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 390 states and 533 transitions. [2018-10-27 00:34:20,742 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 533 transitions. [2018-10-27 00:34:20,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-27 00:34:20,743 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:20,765 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:20,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:20,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 401 states and 547 transitions. [2018-10-27 00:34:20,942 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 547 transitions. [2018-10-27 00:34:20,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-27 00:34:20,943 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:34:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:21,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 408 states and 555 transitions. [2018-10-27 00:34:21,118 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 555 transitions. [2018-10-27 00:34:21,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-27 00:34:21,119 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:21,141 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 00:34:21,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:21,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 409 states and 557 transitions. [2018-10-27 00:34:21,274 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 557 transitions. [2018-10-27 00:34:21,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-27 00:34:21,275 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:21,297 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 00:34:21,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:21,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 410 states and 559 transitions. [2018-10-27 00:34:21,397 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 559 transitions. [2018-10-27 00:34:21,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-27 00:34:21,398 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:21,573 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:21,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:21,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 424 states and 574 transitions. [2018-10-27 00:34:21,905 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 574 transitions. [2018-10-27 00:34:21,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-27 00:34:21,906 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:21,933 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:34:22,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:22,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 433 states and 583 transitions. [2018-10-27 00:34:22,337 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 583 transitions. [2018-10-27 00:34:22,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-27 00:34:22,337 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:22,365 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:34:22,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:22,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 440 states and 589 transitions. [2018-10-27 00:34:22,519 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 589 transitions. [2018-10-27 00:34:22,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-27 00:34:22,520 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:22,545 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 00:34:22,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:22,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 445 states and 594 transitions. [2018-10-27 00:34:22,568 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 594 transitions. [2018-10-27 00:34:22,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-27 00:34:22,569 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:22,591 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 00:34:23,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 450 states and 600 transitions. [2018-10-27 00:34:23,310 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 600 transitions. [2018-10-27 00:34:23,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-27 00:34:23,311 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:24,037 WARN L179 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-10-27 00:34:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:26,793 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 00:34:28,329 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 00:34:29,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:29,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 457 states and 610 transitions. [2018-10-27 00:34:29,684 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 610 transitions. [2018-10-27 00:34:29,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-27 00:34:29,685 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:29,715 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 00:34:30,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:30,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 464 states and 617 transitions. [2018-10-27 00:34:30,128 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 617 transitions. [2018-10-27 00:34:30,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-27 00:34:30,128 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:30,157 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 00:34:30,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:30,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 471 states and 624 transitions. [2018-10-27 00:34:30,630 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 624 transitions. [2018-10-27 00:34:30,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-27 00:34:30,631 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:32,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:32,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 491 states and 646 transitions. [2018-10-27 00:34:32,773 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 646 transitions. [2018-10-27 00:34:32,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-27 00:34:32,773 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:32,801 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 00:34:32,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:32,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 493 states and 648 transitions. [2018-10-27 00:34:32,972 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 648 transitions. [2018-10-27 00:34:32,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-27 00:34:32,973 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:33,042 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 00:34:33,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:33,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 495 states and 650 transitions. [2018-10-27 00:34:33,211 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 650 transitions. [2018-10-27 00:34:33,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-27 00:34:33,212 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 525 states and 687 transitions. [2018-10-27 00:34:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 687 transitions. [2018-10-27 00:34:35,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-27 00:34:35,329 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:35,778 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:36,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:36,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 531 states and 696 transitions. [2018-10-27 00:34:36,007 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 696 transitions. [2018-10-27 00:34:36,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-27 00:34:36,007 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:36,044 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:36,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:36,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 535 states and 701 transitions. [2018-10-27 00:34:36,352 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 701 transitions. [2018-10-27 00:34:36,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-27 00:34:36,353 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:36,432 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:37,993 WARN L179 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 14 [2018-10-27 00:34:39,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:39,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 548 states and 716 transitions. [2018-10-27 00:34:39,352 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 716 transitions. [2018-10-27 00:34:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-27 00:34:39,353 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:39,421 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:39,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:39,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 553 states and 725 transitions. [2018-10-27 00:34:39,742 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 725 transitions. [2018-10-27 00:34:39,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-27 00:34:39,743 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:39,997 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:40,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:40,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 559 states and 731 transitions. [2018-10-27 00:34:40,403 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 731 transitions. [2018-10-27 00:34:40,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-27 00:34:40,405 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:40,435 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:34:41,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:41,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 568 states and 740 transitions. [2018-10-27 00:34:41,443 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 740 transitions. [2018-10-27 00:34:41,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-27 00:34:41,443 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:41,500 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:34:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 571 states and 742 transitions. [2018-10-27 00:34:41,614 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 742 transitions. [2018-10-27 00:34:41,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-27 00:34:41,615 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:44,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:44,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 598 states and 785 transitions. [2018-10-27 00:34:44,207 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 785 transitions. [2018-10-27 00:34:44,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-27 00:34:44,208 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:44,985 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:45,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 615 states and 807 transitions. [2018-10-27 00:34:45,606 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 807 transitions. [2018-10-27 00:34:45,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-27 00:34:45,607 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:45,635 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 00:34:45,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:45,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 627 states and 819 transitions. [2018-10-27 00:34:45,699 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 819 transitions. [2018-10-27 00:34:45,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-27 00:34:45,700 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:45,733 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 00:34:45,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 639 states and 832 transitions. [2018-10-27 00:34:45,940 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 832 transitions. [2018-10-27 00:34:45,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-27 00:34:45,941 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:46,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:46,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 650 states and 853 transitions. [2018-10-27 00:34:46,937 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 853 transitions. [2018-10-27 00:34:46,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-27 00:34:46,938 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:46,971 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:47,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:47,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 653 states and 856 transitions. [2018-10-27 00:34:47,355 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 856 transitions. [2018-10-27 00:34:47,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-27 00:34:47,356 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:47,404 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 00:34:47,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:47,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 660 states and 864 transitions. [2018-10-27 00:34:47,869 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 864 transitions. [2018-10-27 00:34:47,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-27 00:34:47,869 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:47,895 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:48,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:48,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 679 states and 886 transitions. [2018-10-27 00:34:48,177 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 886 transitions. [2018-10-27 00:34:48,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-27 00:34:48,178 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:48,368 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 00:34:49,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:49,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 729 states and 942 transitions. [2018-10-27 00:34:49,457 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 942 transitions. [2018-10-27 00:34:49,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-27 00:34:49,458 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 00:34:50,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:50,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 773 states and 988 transitions. [2018-10-27 00:34:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 988 transitions. [2018-10-27 00:34:50,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-27 00:34:50,464 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:50,573 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 00:34:50,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 778 states and 995 transitions. [2018-10-27 00:34:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 995 transitions. [2018-10-27 00:34:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-27 00:34:50,833 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:34:51,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 780 states and 996 transitions. [2018-10-27 00:34:51,072 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 996 transitions. [2018-10-27 00:34:51,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-27 00:34:51,073 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:51,103 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:34:51,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:51,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 790 states and 1010 transitions. [2018-10-27 00:34:51,794 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1010 transitions. [2018-10-27 00:34:51,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-27 00:34:51,796 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:51,829 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:34:52,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 792 states and 1012 transitions. [2018-10-27 00:34:52,147 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1012 transitions. [2018-10-27 00:34:52,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-27 00:34:52,148 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 00:34:52,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:52,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 794 states and 1014 transitions. [2018-10-27 00:34:52,836 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1014 transitions. [2018-10-27 00:34:52,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-27 00:34:52,837 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:53,083 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-27 00:34:53,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:53,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 879 states and 1107 transitions. [2018-10-27 00:34:53,869 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1107 transitions. [2018-10-27 00:34:53,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-27 00:34:53,870 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:53,899 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-27 00:34:54,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:54,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 893 states and 1127 transitions. [2018-10-27 00:34:54,619 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1127 transitions. [2018-10-27 00:34:54,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-27 00:34:54,620 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-27 00:34:55,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:55,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 895 states and 1129 transitions. [2018-10-27 00:34:55,026 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1129 transitions. [2018-10-27 00:34:55,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-27 00:34:55,027 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:34:55,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:55,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 923 states and 1162 transitions. [2018-10-27 00:34:55,601 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1162 transitions. [2018-10-27 00:34:55,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-27 00:34:55,602 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:55,668 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 00:34:55,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:55,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 924 states and 1164 transitions. [2018-10-27 00:34:55,682 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1164 transitions. [2018-10-27 00:34:55,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-27 00:34:55,683 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 00:34:56,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:56,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 925 states and 1165 transitions. [2018-10-27 00:34:56,178 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1165 transitions. [2018-10-27 00:34:56,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-27 00:34:56,179 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:56,241 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-27 00:34:56,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:56,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 927 states and 1166 transitions. [2018-10-27 00:34:56,414 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1166 transitions. [2018-10-27 00:34:56,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-27 00:34:56,415 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:56,453 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 00:34:57,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:57,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 954 states and 1197 transitions. [2018-10-27 00:34:57,115 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1197 transitions. [2018-10-27 00:34:57,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-27 00:34:57,116 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:57,148 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 00:34:57,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:57,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 957 states and 1200 transitions. [2018-10-27 00:34:57,294 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1200 transitions. [2018-10-27 00:34:57,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-27 00:34:57,294 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:57,361 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 00:34:58,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:34:58,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 988 states and 1230 transitions. [2018-10-27 00:34:58,158 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1230 transitions. [2018-10-27 00:34:58,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-27 00:34:58,159 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:34:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:34:58,533 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:35:00,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:00,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1016 states and 1265 transitions. [2018-10-27 00:35:00,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1265 transitions. [2018-10-27 00:35:00,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-27 00:35:00,127 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:00,169 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-27 00:35:00,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:00,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1027 states and 1277 transitions. [2018-10-27 00:35:00,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1277 transitions. [2018-10-27 00:35:00,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-27 00:35:00,227 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:00,266 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-27 00:35:00,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:00,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1038 states and 1289 transitions. [2018-10-27 00:35:00,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1289 transitions. [2018-10-27 00:35:00,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-27 00:35:00,519 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-27 00:35:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:00,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1039 states and 1290 transitions. [2018-10-27 00:35:00,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1290 transitions. [2018-10-27 00:35:00,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-27 00:35:00,654 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:00,699 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-27 00:35:00,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:00,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1040 states and 1291 transitions. [2018-10-27 00:35:00,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1291 transitions. [2018-10-27 00:35:00,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-27 00:35:00,790 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-27 00:35:02,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:02,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1061 states and 1318 transitions. [2018-10-27 00:35:02,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1318 transitions. [2018-10-27 00:35:02,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-27 00:35:02,423 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-27 00:35:02,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:02,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1062 states and 1319 transitions. [2018-10-27 00:35:02,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1319 transitions. [2018-10-27 00:35:02,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-27 00:35:02,557 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:02,607 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-27 00:35:03,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:03,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1117 states and 1376 transitions. [2018-10-27 00:35:03,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1376 transitions. [2018-10-27 00:35:03,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-27 00:35:03,099 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:03,441 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-27 00:35:04,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1128 states and 1400 transitions. [2018-10-27 00:35:04,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1400 transitions. [2018-10-27 00:35:04,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-27 00:35:04,559 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:04,670 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-27 00:35:04,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:04,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1131 states and 1403 transitions. [2018-10-27 00:35:04,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1403 transitions. [2018-10-27 00:35:04,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-27 00:35:04,954 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-27 00:35:07,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:07,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1197 states and 1479 transitions. [2018-10-27 00:35:07,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1479 transitions. [2018-10-27 00:35:07,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-27 00:35:07,121 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:07,242 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 00:35:07,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1214 states and 1501 transitions. [2018-10-27 00:35:07,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1501 transitions. [2018-10-27 00:35:07,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-27 00:35:07,880 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:08,062 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 00:35:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1217 states and 1503 transitions. [2018-10-27 00:35:08,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1503 transitions. [2018-10-27 00:35:08,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-27 00:35:08,290 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:08,352 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-27 00:35:08,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:08,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1226 states and 1513 transitions. [2018-10-27 00:35:08,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1513 transitions. [2018-10-27 00:35:08,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-27 00:35:08,782 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-27 00:35:09,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:09,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1232 states and 1525 transitions. [2018-10-27 00:35:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1525 transitions. [2018-10-27 00:35:09,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-27 00:35:09,515 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:09,669 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 00:35:10,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:10,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1240 states and 1538 transitions. [2018-10-27 00:35:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1538 transitions. [2018-10-27 00:35:10,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-27 00:35:10,177 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:10,273 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 00:35:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1251 states and 1551 transitions. [2018-10-27 00:35:10,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1551 transitions. [2018-10-27 00:35:10,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-27 00:35:10,914 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:11,066 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 00:35:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1255 states and 1559 transitions. [2018-10-27 00:35:11,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1559 transitions. [2018-10-27 00:35:11,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-27 00:35:11,241 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:11,268 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-27 00:35:11,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:11,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1271 states and 1575 transitions. [2018-10-27 00:35:11,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1575 transitions. [2018-10-27 00:35:11,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-27 00:35:11,428 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:11,467 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-27 00:35:11,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:11,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1278 states and 1582 transitions. [2018-10-27 00:35:11,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1582 transitions. [2018-10-27 00:35:11,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-27 00:35:11,733 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:11,767 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-27 00:35:12,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:12,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1285 states and 1588 transitions. [2018-10-27 00:35:12,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1588 transitions. [2018-10-27 00:35:12,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-27 00:35:12,157 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:12,960 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:35:17,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:17,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1337 states and 1660 transitions. [2018-10-27 00:35:17,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1660 transitions. [2018-10-27 00:35:17,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-27 00:35:17,292 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:17,370 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:35:18,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:18,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1344 states and 1669 transitions. [2018-10-27 00:35:18,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1669 transitions. [2018-10-27 00:35:18,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-27 00:35:18,277 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:18,660 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-27 00:35:19,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:19,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1354 states and 1685 transitions. [2018-10-27 00:35:19,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1685 transitions. [2018-10-27 00:35:19,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-27 00:35:19,926 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:19,985 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-27 00:35:20,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:20,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1412 states and 1744 transitions. [2018-10-27 00:35:20,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 1744 transitions. [2018-10-27 00:35:20,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-27 00:35:20,515 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:20,566 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-27 00:35:21,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:21,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1469 states and 1804 transitions. [2018-10-27 00:35:21,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 1804 transitions. [2018-10-27 00:35:21,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-27 00:35:21,580 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:21,633 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:35:21,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1473 states and 1808 transitions. [2018-10-27 00:35:21,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 1808 transitions. [2018-10-27 00:35:21,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-27 00:35:21,663 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:21,691 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-10-27 00:35:23,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:23,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1488 states and 1829 transitions. [2018-10-27 00:35:23,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1829 transitions. [2018-10-27 00:35:23,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-27 00:35:23,210 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:35:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:24,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1521 states and 1867 transitions. [2018-10-27 00:35:24,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1867 transitions. [2018-10-27 00:35:24,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-27 00:35:24,239 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:24,283 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:35:24,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:24,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1528 states and 1874 transitions. [2018-10-27 00:35:24,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1874 transitions. [2018-10-27 00:35:24,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-27 00:35:24,857 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:25,379 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-27 00:35:26,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:26,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1533 states and 1885 transitions. [2018-10-27 00:35:26,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1885 transitions. [2018-10-27 00:35:26,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-27 00:35:26,669 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:26,850 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-27 00:35:27,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:27,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1536 states and 1889 transitions. [2018-10-27 00:35:27,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 1889 transitions. [2018-10-27 00:35:27,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-27 00:35:27,161 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:27,197 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 00:35:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:29,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1573 states and 1930 transitions. [2018-10-27 00:35:29,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1930 transitions. [2018-10-27 00:35:29,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-27 00:35:29,849 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:29,879 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 00:35:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:30,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1578 states and 1935 transitions. [2018-10-27 00:35:30,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 1935 transitions. [2018-10-27 00:35:30,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-27 00:35:30,220 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:30,261 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-10-27 00:35:31,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1591 states and 1950 transitions. [2018-10-27 00:35:31,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 1950 transitions. [2018-10-27 00:35:31,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-27 00:35:31,496 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-10-27 00:35:31,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1596 states and 1956 transitions. [2018-10-27 00:35:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 1956 transitions. [2018-10-27 00:35:31,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-27 00:35:31,821 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:31,860 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 00:35:32,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:32,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1615 states and 1975 transitions. [2018-10-27 00:35:32,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 1975 transitions. [2018-10-27 00:35:32,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-27 00:35:32,189 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:32,559 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-27 00:35:33,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:33,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1630 states and 1994 transitions. [2018-10-27 00:35:33,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 1994 transitions. [2018-10-27 00:35:33,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-27 00:35:33,318 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:33,690 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-27 00:35:33,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:33,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1632 states and 1995 transitions. [2018-10-27 00:35:33,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 1995 transitions. [2018-10-27 00:35:33,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-27 00:35:33,846 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:34,173 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-27 00:35:34,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:34,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 1642 states and 2005 transitions. [2018-10-27 00:35:34,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2005 transitions. [2018-10-27 00:35:34,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-27 00:35:34,484 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-27 00:35:34,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:34,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 1652 states and 2017 transitions. [2018-10-27 00:35:34,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2017 transitions. [2018-10-27 00:35:34,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-27 00:35:34,962 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:34,990 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:35:35,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:35,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 1657 states and 2023 transitions. [2018-10-27 00:35:35,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2023 transitions. [2018-10-27 00:35:35,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-27 00:35:35,392 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:35,447 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-27 00:35:36,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:36,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 1667 states and 2036 transitions. [2018-10-27 00:35:36,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2036 transitions. [2018-10-27 00:35:36,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-27 00:35:36,079 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-27 00:35:36,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:36,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 1668 states and 2037 transitions. [2018-10-27 00:35:36,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2037 transitions. [2018-10-27 00:35:36,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-27 00:35:36,448 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:36,477 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-27 00:35:36,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 1681 states and 2051 transitions. [2018-10-27 00:35:36,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2051 transitions. [2018-10-27 00:35:36,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-27 00:35:36,935 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:36,963 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-27 00:35:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:37,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 1682 states and 2052 transitions. [2018-10-27 00:35:37,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2052 transitions. [2018-10-27 00:35:37,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-27 00:35:37,281 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:37,309 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-27 00:35:37,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:37,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 1687 states and 2057 transitions. [2018-10-27 00:35:37,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2057 transitions. [2018-10-27 00:35:37,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-27 00:35:37,483 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-27 00:35:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:38,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 1775 states and 2148 transitions. [2018-10-27 00:35:38,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2148 transitions. [2018-10-27 00:35:38,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-27 00:35:38,839 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:38,877 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 00:35:39,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:39,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 1777 states and 2149 transitions. [2018-10-27 00:35:39,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2149 transitions. [2018-10-27 00:35:39,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-27 00:35:39,508 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:39,908 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 191 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-27 00:35:40,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 1801 states and 2174 transitions. [2018-10-27 00:35:40,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2174 transitions. [2018-10-27 00:35:40,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-27 00:35:40,573 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:40,625 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 113 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 00:35:42,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:42,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 1832 states and 2221 transitions. [2018-10-27 00:35:42,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2221 transitions. [2018-10-27 00:35:42,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-27 00:35:42,691 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:42,791 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 113 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 00:35:43,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:43,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 1837 states and 2225 transitions. [2018-10-27 00:35:43,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2225 transitions. [2018-10-27 00:35:43,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-27 00:35:43,141 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 113 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 00:35:43,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:43,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 1844 states and 2232 transitions. [2018-10-27 00:35:43,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2232 transitions. [2018-10-27 00:35:43,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-27 00:35:43,695 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:43,782 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-27 00:35:45,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:45,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 1869 states and 2264 transitions. [2018-10-27 00:35:45,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2264 transitions. [2018-10-27 00:35:45,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-27 00:35:45,072 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-27 00:35:45,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:45,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 1881 states and 2278 transitions. [2018-10-27 00:35:45,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2278 transitions. [2018-10-27 00:35:45,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-27 00:35:45,629 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:45,674 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-27 00:35:45,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:45,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 1882 states and 2279 transitions. [2018-10-27 00:35:45,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2279 transitions. [2018-10-27 00:35:45,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-27 00:35:45,795 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:46,054 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-27 00:35:46,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:46,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 1883 states and 2281 transitions. [2018-10-27 00:35:46,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 2281 transitions. [2018-10-27 00:35:46,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-27 00:35:46,080 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:46,159 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 00:35:47,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:47,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 1907 states and 2308 transitions. [2018-10-27 00:35:47,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2308 transitions. [2018-10-27 00:35:47,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-27 00:35:47,668 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:47,763 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 00:35:48,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:48,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 1917 states and 2318 transitions. [2018-10-27 00:35:48,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2318 transitions. [2018-10-27 00:35:48,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-27 00:35:48,816 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:50,265 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-27 00:35:54,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:54,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 1965 states and 2366 transitions. [2018-10-27 00:35:54,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2366 transitions. [2018-10-27 00:35:54,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-27 00:35:54,082 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:35:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:54,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 1980 states and 2385 transitions. [2018-10-27 00:35:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 2385 transitions. [2018-10-27 00:35:54,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-27 00:35:54,862 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:54,902 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:35:56,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:56,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2006 states and 2411 transitions. [2018-10-27 00:35:56,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 2411 transitions. [2018-10-27 00:35:56,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-27 00:35:56,690 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:35:57,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:57,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2011 states and 2416 transitions. [2018-10-27 00:35:57,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2416 transitions. [2018-10-27 00:35:57,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-27 00:35:57,646 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:57,700 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-27 00:35:59,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:59,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2071 states and 2478 transitions. [2018-10-27 00:35:59,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 2478 transitions. [2018-10-27 00:35:59,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-27 00:35:59,007 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:59,047 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-27 00:35:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:35:59,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2084 states and 2490 transitions. [2018-10-27 00:35:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2490 transitions. [2018-10-27 00:35:59,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-27 00:35:59,263 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:35:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:35:59,345 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 111 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 00:36:00,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:00,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2115 states and 2520 transitions. [2018-10-27 00:36:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2520 transitions. [2018-10-27 00:36:00,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-27 00:36:00,969 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:01,020 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-10-27 00:36:01,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:01,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2139 states and 2545 transitions. [2018-10-27 00:36:01,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2545 transitions. [2018-10-27 00:36:01,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-27 00:36:01,897 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:03,724 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 178 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:36:07,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:07,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2217 states and 2635 transitions. [2018-10-27 00:36:07,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 2635 transitions. [2018-10-27 00:36:07,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-27 00:36:07,111 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 191 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:36:10,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:10,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2229 states and 2655 transitions. [2018-10-27 00:36:10,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 2655 transitions. [2018-10-27 00:36:10,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-27 00:36:10,216 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:10,249 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 00:36:10,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2236 states and 2666 transitions. [2018-10-27 00:36:10,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2666 transitions. [2018-10-27 00:36:10,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-27 00:36:10,308 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:11,528 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 203 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:36:13,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:13,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2248 states and 2683 transitions. [2018-10-27 00:36:13,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 2683 transitions. [2018-10-27 00:36:13,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-27 00:36:13,886 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:14,286 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 175 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:36:17,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:17,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2323 states and 2766 transitions. [2018-10-27 00:36:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 2766 transitions. [2018-10-27 00:36:17,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-27 00:36:17,166 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-27 00:36:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:18,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2332 states and 2781 transitions. [2018-10-27 00:36:18,610 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 2781 transitions. [2018-10-27 00:36:18,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-27 00:36:18,612 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-27 00:36:19,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:19,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2335 states and 2783 transitions. [2018-10-27 00:36:19,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 2783 transitions. [2018-10-27 00:36:19,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-27 00:36:19,131 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:19,189 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-10-27 00:36:20,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:20,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2359 states and 2809 transitions. [2018-10-27 00:36:20,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 2809 transitions. [2018-10-27 00:36:20,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-27 00:36:20,378 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:20,415 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-10-27 00:36:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:21,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2366 states and 2816 transitions. [2018-10-27 00:36:21,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 2816 transitions. [2018-10-27 00:36:21,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-27 00:36:21,375 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:21,428 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-27 00:36:22,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:22,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2437 states and 2890 transitions. [2018-10-27 00:36:22,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 2890 transitions. [2018-10-27 00:36:22,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-27 00:36:22,710 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-27 00:36:26,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:26,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2495 states and 2951 transitions. [2018-10-27 00:36:26,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 2951 transitions. [2018-10-27 00:36:26,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-27 00:36:26,268 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:26,326 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-27 00:36:26,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2516 states and 2971 transitions. [2018-10-27 00:36:26,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2516 states and 2971 transitions. [2018-10-27 00:36:26,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-27 00:36:26,658 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:26,767 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-10-27 00:36:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:28,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3003 states to 2540 states and 3003 transitions. [2018-10-27 00:36:28,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 3003 transitions. [2018-10-27 00:36:28,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-27 00:36:28,825 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:28,926 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-10-27 00:36:29,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:29,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3024 states to 2562 states and 3024 transitions. [2018-10-27 00:36:29,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 3024 transitions. [2018-10-27 00:36:29,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-27 00:36:29,961 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:30,299 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-10-27 00:36:32,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:32,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 2630 states and 3096 transitions. [2018-10-27 00:36:32,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3096 transitions. [2018-10-27 00:36:32,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-27 00:36:32,079 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:32,181 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-10-27 00:36:32,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:32,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 2641 states and 3106 transitions. [2018-10-27 00:36:32,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2641 states and 3106 transitions. [2018-10-27 00:36:32,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-27 00:36:32,748 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:32,856 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-10-27 00:36:33,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:33,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 2643 states and 3108 transitions. [2018-10-27 00:36:33,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 3108 transitions. [2018-10-27 00:36:33,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-27 00:36:33,191 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:33,295 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-10-27 00:36:33,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:33,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 2644 states and 3108 transitions. [2018-10-27 00:36:33,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3108 transitions. [2018-10-27 00:36:33,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-27 00:36:33,707 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:33,766 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-10-27 00:36:34,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 2657 states and 3122 transitions. [2018-10-27 00:36:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 3122 transitions. [2018-10-27 00:36:34,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-27 00:36:34,879 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:34,938 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-10-27 00:36:35,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:35,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 2659 states and 3123 transitions. [2018-10-27 00:36:35,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2659 states and 3123 transitions. [2018-10-27 00:36:35,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-27 00:36:35,417 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:36,185 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 303 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:36:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:39,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 2701 states and 3184 transitions. [2018-10-27 00:36:39,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3184 transitions. [2018-10-27 00:36:39,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-27 00:36:39,941 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:40,029 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 303 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:36:42,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:42,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3197 states to 2713 states and 3197 transitions. [2018-10-27 00:36:42,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 3197 transitions. [2018-10-27 00:36:42,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-27 00:36:42,084 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:42,181 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 303 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:36:43,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:43,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 2721 states and 3205 transitions. [2018-10-27 00:36:43,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2721 states and 3205 transitions. [2018-10-27 00:36:43,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-27 00:36:43,563 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:43,658 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 303 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:36:45,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:45,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 2748 states and 3234 transitions. [2018-10-27 00:36:45,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2748 states and 3234 transitions. [2018-10-27 00:36:45,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-27 00:36:45,142 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:45,232 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 303 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:36:45,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:45,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3235 states to 2750 states and 3235 transitions. [2018-10-27 00:36:45,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 3235 transitions. [2018-10-27 00:36:45,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-27 00:36:45,724 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:46,217 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 161 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:36:50,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:50,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3283 states to 2792 states and 3283 transitions. [2018-10-27 00:36:50,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 3283 transitions. [2018-10-27 00:36:50,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-27 00:36:50,033 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 161 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:36:51,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:51,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 2812 states and 3306 transitions. [2018-10-27 00:36:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 3306 transitions. [2018-10-27 00:36:51,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-27 00:36:51,777 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:52,078 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 161 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:36:52,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:52,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 2814 states and 3308 transitions. [2018-10-27 00:36:52,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 3308 transitions. [2018-10-27 00:36:52,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-27 00:36:52,609 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:36:53,629 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 74 proven. 194 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-27 00:36:55,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:36:55,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3325 states to 2825 states and 3325 transitions. [2018-10-27 00:36:55,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3325 transitions. [2018-10-27 00:36:55,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-27 00:36:55,355 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:36:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 00:36:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 00:36:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 00:36:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 00:36:55,656 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 161 iterations. [2018-10-27 00:36:55,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 27.10 12:36:55 ImpRootNode [2018-10-27 00:36:55,874 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-27 00:36:55,874 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 00:36:55,875 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 00:36:55,875 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 00:36:55,875 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:34:10" (3/4) ... [2018-10-27 00:36:55,881 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-27 00:36:56,079 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_136186f1-92b8-4045-a404-89b05683c55f/bin-2019/ukojak/witness.graphml [2018-10-27 00:36:56,079 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 00:36:56,080 INFO L168 Benchmark]: Toolchain (without parser) took 171896.01 ms. Allocated memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: 2.2 GB). Free memory was 950.4 MB in the beginning and 1.6 GB in the end (delta: -643.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-10-27 00:36:56,080 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 00:36:56,082 INFO L168 Benchmark]: CACSL2BoogieTranslator took 481.13 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 923.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-10-27 00:36:56,082 INFO L168 Benchmark]: Boogie Procedure Inliner took 245.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 923.5 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2018-10-27 00:36:56,082 INFO L168 Benchmark]: Boogie Preprocessor took 69.04 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-27 00:36:56,082 INFO L168 Benchmark]: RCFGBuilder took 5169.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 892.5 MB in the end (delta: 221.7 MB). Peak memory consumption was 221.7 MB. Max. memory is 11.5 GB. [2018-10-27 00:36:56,083 INFO L168 Benchmark]: CodeCheck took 165722.62 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 892.5 MB in the beginning and 1.6 GB in the end (delta: -701.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-10-27 00:36:56,085 INFO L168 Benchmark]: Witness Printer took 204.39 ms. Allocated memory is still 3.2 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 6.0 kB). Peak memory consumption was 6.0 kB. Max. memory is 11.5 GB. [2018-10-27 00:36:56,087 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 199 locations, 1 error locations. UNSAFE Result, 165.4s OverallTime, 161 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 909181988 SDtfs, -1042155768 SDslu, -1316478688 SDs, 0 SdLazy, 366971276 SolverSat, -95607996 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1082.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 167188 GetRequests, 163493 SyntacticMatches, 2265 SemanticMatches, 1430 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1446882 ImplicationChecksByTransitivity, 140.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.6s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 26.6s InterpolantComputationTime, 24797 NumberOfCodeBlocks, 24797 NumberOfCodeBlocksAsserted, 161 NumberOfCheckSat, 24397 ConstructedInterpolants, 0 QuantifiedInterpolants, 12416678 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 160 InterpolantComputations, 131 PerfectInterpolantSequences, 19383/20227 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 422]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] RET return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] RET return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] RET return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND 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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [L278] COND TRUE (((((((!(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)) [L279] a20 = 1 [L280] a8 = 13 [L281] a16 = 4 [L282] a7 = 0 [L283] a21 = 1 [L284] a17 = 0 [L285] RET return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L415] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L418] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L421] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L422] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 481.13 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 923.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 245.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 923.5 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.04 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5169.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 892.5 MB in the end (delta: 221.7 MB). Peak memory consumption was 221.7 MB. Max. memory is 11.5 GB. * CodeCheck took 165722.62 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 892.5 MB in the beginning and 1.6 GB in the end (delta: -701.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 204.39 ms. Allocated memory is still 3.2 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 6.0 kB). Peak memory consumption was 6.0 kB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...