./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label32_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_25ac477e-acd3-4d6d-92c7-d799064ee2ac/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_25ac477e-acd3-4d6d-92c7-d799064ee2ac/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_25ac477e-acd3-4d6d-92c7-d799064ee2ac/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_25ac477e-acd3-4d6d-92c7-d799064ee2ac/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label32_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_25ac477e-acd3-4d6d-92c7-d799064ee2ac/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_25ac477e-acd3-4d6d-92c7-d799064ee2ac/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 01168fbb381348520b892fee62d1bbd6a25fcfcb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 05:01:52,188 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 05:01:52,189 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 05:01:52,196 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 05:01:52,197 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 05:01:52,197 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 05:01:52,198 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 05:01:52,199 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 05:01:52,200 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 05:01:52,200 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 05:01:52,201 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 05:01:52,201 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 05:01:52,202 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 05:01:52,202 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 05:01:52,203 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 05:01:52,204 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 05:01:52,204 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 05:01:52,206 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 05:01:52,207 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 05:01:52,208 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 05:01:52,209 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 05:01:52,210 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 05:01:52,211 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 05:01:52,211 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 05:01:52,211 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 05:01:52,212 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 05:01:52,212 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 05:01:52,213 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 05:01:52,213 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 05:01:52,214 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 05:01:52,214 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 05:01:52,214 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 05:01:52,214 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 05:01:52,214 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 05:01:52,215 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 05:01:52,215 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 05:01:52,215 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_25ac477e-acd3-4d6d-92c7-d799064ee2ac/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-09 05:01:52,223 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 05:01:52,223 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 05:01:52,224 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 05:01:52,224 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-09 05:01:52,224 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 05:01:52,225 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 05:01:52,225 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 05:01:52,225 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 05:01:52,225 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 05:01:52,225 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 05:01:52,225 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 05:01:52,225 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 05:01:52,226 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 05:01:52,226 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 05:01:52,226 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 05:01:52,226 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 05:01:52,226 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 05:01:52,226 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 05:01:52,226 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-09 05:01:52,226 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-09 05:01:52,227 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 05:01:52,227 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 05:01:52,227 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-09 05:01:52,227 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 05:01:52,227 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 05:01:52,227 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 05:01:52,227 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-09 05:01:52,228 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 05:01:52,228 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 05:01:52,228 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_25ac477e-acd3-4d6d-92c7-d799064ee2ac/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 -> 01168fbb381348520b892fee62d1bbd6a25fcfcb [2018-12-09 05:01:52,252 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 05:01:52,261 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 05:01:52,263 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 05:01:52,264 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 05:01:52,264 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 05:01:52,265 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_25ac477e-acd3-4d6d-92c7-d799064ee2ac/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label32_false-unreach-call_false-termination.c [2018-12-09 05:01:52,303 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25ac477e-acd3-4d6d-92c7-d799064ee2ac/bin-2019/ukojak/data/5ba1d621c/3d2b9a799ff7415f9ee38def0e735d3b/FLAGedbba010d [2018-12-09 05:01:52,787 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 05:01:52,787 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_25ac477e-acd3-4d6d-92c7-d799064ee2ac/sv-benchmarks/c/eca-rers2012/Problem01_label32_false-unreach-call_false-termination.c [2018-12-09 05:01:52,795 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25ac477e-acd3-4d6d-92c7-d799064ee2ac/bin-2019/ukojak/data/5ba1d621c/3d2b9a799ff7415f9ee38def0e735d3b/FLAGedbba010d [2018-12-09 05:01:52,805 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_25ac477e-acd3-4d6d-92c7-d799064ee2ac/bin-2019/ukojak/data/5ba1d621c/3d2b9a799ff7415f9ee38def0e735d3b [2018-12-09 05:01:52,806 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 05:01:52,807 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 05:01:52,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 05:01:52,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 05:01:52,810 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 05:01:52,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:01:52" (1/1) ... [2018-12-09 05:01:52,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f792852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:01:52, skipping insertion in model container [2018-12-09 05:01:52,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:01:52" (1/1) ... [2018-12-09 05:01:52,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 05:01:52,844 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 05:01:53,035 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:01:53,039 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 05:01:53,143 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:01:53,156 INFO L195 MainTranslator]: Completed translation [2018-12-09 05:01:53,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:01:53 WrapperNode [2018-12-09 05:01:53,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 05:01:53,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 05:01:53,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 05:01:53,158 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 05:01:53,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:01:53" (1/1) ... [2018-12-09 05:01:53,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:01:53" (1/1) ... [2018-12-09 05:01:53,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 05:01:53,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 05:01:53,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 05:01:53,210 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 05:01:53,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:01:53" (1/1) ... [2018-12-09 05:01:53,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:01:53" (1/1) ... [2018-12-09 05:01:53,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:01:53" (1/1) ... [2018-12-09 05:01:53,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:01:53" (1/1) ... [2018-12-09 05:01:53,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:01:53" (1/1) ... [2018-12-09 05:01:53,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:01:53" (1/1) ... [2018-12-09 05:01:53,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:01:53" (1/1) ... [2018-12-09 05:01:53,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 05:01:53,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 05:01:53,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 05:01:53,253 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 05:01:53,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:01:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25ac477e-acd3-4d6d-92c7-d799064ee2ac/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-09 05:01:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 05:01:53,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 05:01:54,289 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 05:01:54,290 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-09 05:01:54,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:01:54 BoogieIcfgContainer [2018-12-09 05:01:54,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 05:01:54,291 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-09 05:01:54,291 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-09 05:01:54,300 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-09 05:01:54,301 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:01:54" (1/1) ... [2018-12-09 05:01:54,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:01:54,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:01:54,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2018-12-09 05:01:54,343 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2018-12-09 05:01:54,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 05:01:54,346 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:01:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:01:54,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:01:54,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:01:54,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 145 states and 231 transitions. [2018-12-09 05:01:54,822 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 231 transitions. [2018-12-09 05:01:54,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 05:01:54,823 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:01:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:01:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:01:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:01:55,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 215 states and 304 transitions. [2018-12-09 05:01:55,195 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 304 transitions. [2018-12-09 05:01:55,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 05:01:55,197 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:01:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:01:55,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:01:55,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:01:55,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 285 states and 378 transitions. [2018-12-09 05:01:55,587 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 378 transitions. [2018-12-09 05:01:55,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-09 05:01:55,589 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:01:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:01:55,632 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:01:55,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:01:55,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 300 states and 397 transitions. [2018-12-09 05:01:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 397 transitions. [2018-12-09 05:01:55,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 05:01:55,717 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:01:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:01:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 05:01:55,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:01:55,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 301 states and 399 transitions. [2018-12-09 05:01:55,832 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 399 transitions. [2018-12-09 05:01:55,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 05:01:55,836 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:01:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:01:55,869 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:01:56,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:01:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 321 states and 424 transitions. [2018-12-09 05:01:56,053 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 424 transitions. [2018-12-09 05:01:56,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 05:01:56,054 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:01:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:01:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 05:01:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:01:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 322 states and 426 transitions. [2018-12-09 05:01:56,177 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 426 transitions. [2018-12-09 05:01:56,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 05:01:56,177 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:01:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:01:56,201 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 05:01:56,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:01:56,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 323 states and 428 transitions. [2018-12-09 05:01:56,303 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 428 transitions. [2018-12-09 05:01:56,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 05:01:56,304 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:01:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:01:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 05:01:56,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:01:56,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 328 states and 434 transitions. [2018-12-09 05:01:56,437 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 434 transitions. [2018-12-09 05:01:56,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 05:01:56,438 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:01:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:01:56,456 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:01:56,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:01:56,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 342 states and 448 transitions. [2018-12-09 05:01:56,644 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 448 transitions. [2018-12-09 05:01:56,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 05:01:56,645 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:01:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:01:56,714 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 05:01:56,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:01:56,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 356 states and 469 transitions. [2018-12-09 05:01:56,980 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 469 transitions. [2018-12-09 05:01:56,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 05:01:56,981 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:01:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:01:57,042 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 05:01:57,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:01:57,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 385 states and 499 transitions. [2018-12-09 05:01:57,278 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 499 transitions. [2018-12-09 05:01:57,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-09 05:01:57,278 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:01:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:01:57,293 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 05:01:57,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:01:57,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 398 states and 514 transitions. [2018-12-09 05:01:57,449 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 514 transitions. [2018-12-09 05:01:57,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 05:01:57,449 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:01:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:01:57,516 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-09 05:01:57,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:01:57,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 407 states and 528 transitions. [2018-12-09 05:01:57,828 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 528 transitions. [2018-12-09 05:01:57,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-09 05:01:57,828 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:01:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:01:57,890 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:01:58,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:01:58,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 447 states and 577 transitions. [2018-12-09 05:01:58,458 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 577 transitions. [2018-12-09 05:01:58,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 05:01:58,459 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:01:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:01:58,480 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 05:01:58,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:01:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 452 states and 582 transitions. [2018-12-09 05:01:58,503 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 582 transitions. [2018-12-09 05:01:58,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 05:01:58,503 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:01:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:01:58,596 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-09 05:01:58,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:01:58,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 466 states and 602 transitions. [2018-12-09 05:01:58,973 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 602 transitions. [2018-12-09 05:01:58,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-09 05:01:58,974 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:01:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:01:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:01:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:01:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 469 states and 605 transitions. [2018-12-09 05:01:59,118 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 605 transitions. [2018-12-09 05:01:59,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-09 05:01:59,119 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:01:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:01:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 05:01:59,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:01:59,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 470 states and 609 transitions. [2018-12-09 05:01:59,398 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 609 transitions. [2018-12-09 05:01:59,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 05:01:59,398 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:01:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:01:59,416 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 05:01:59,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:01:59,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 481 states and 620 transitions. [2018-12-09 05:01:59,499 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 620 transitions. [2018-12-09 05:01:59,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 05:01:59,500 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:01:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:01:59,517 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 05:01:59,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:01:59,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 503 states and 642 transitions. [2018-12-09 05:01:59,579 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 642 transitions. [2018-12-09 05:01:59,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 05:01:59,580 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:01:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:01:59,642 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-09 05:02:00,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:00,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 528 states and 670 transitions. [2018-12-09 05:02:00,172 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 670 transitions. [2018-12-09 05:02:00,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-09 05:02:00,173 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-09 05:02:01,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:01,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 540 states and 686 transitions. [2018-12-09 05:02:01,123 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 686 transitions. [2018-12-09 05:02:01,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-09 05:02:01,123 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:01,157 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-09 05:02:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:01,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 566 states and 715 transitions. [2018-12-09 05:02:01,766 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 715 transitions. [2018-12-09 05:02:01,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-09 05:02:01,767 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:01,817 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-09 05:02:02,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:02,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 569 states and 720 transitions. [2018-12-09 05:02:02,023 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 720 transitions. [2018-12-09 05:02:02,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-09 05:02:02,024 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 05:02:02,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:02,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 594 states and 749 transitions. [2018-12-09 05:02:02,465 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 749 transitions. [2018-12-09 05:02:02,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-09 05:02:02,465 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-09 05:02:02,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 605 states and 762 transitions. [2018-12-09 05:02:02,636 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 762 transitions. [2018-12-09 05:02:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-09 05:02:02,636 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-09 05:02:02,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:02,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 606 states and 762 transitions. [2018-12-09 05:02:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 762 transitions. [2018-12-09 05:02:02,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-09 05:02:02,742 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:02,768 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 05:02:02,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:02,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 613 states and 770 transitions. [2018-12-09 05:02:02,850 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 770 transitions. [2018-12-09 05:02:02,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-09 05:02:02,851 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:02,971 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 05:02:03,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:03,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 658 states and 831 transitions. [2018-12-09 05:02:03,827 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 831 transitions. [2018-12-09 05:02:03,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-09 05:02:03,827 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:03,877 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 05:02:04,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:04,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 678 states and 853 transitions. [2018-12-09 05:02:04,323 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 853 transitions. [2018-12-09 05:02:04,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-09 05:02:04,323 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 05:02:04,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:04,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 686 states and 861 transitions. [2018-12-09 05:02:04,524 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 861 transitions. [2018-12-09 05:02:04,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-09 05:02:04,525 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:04,569 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 05:02:04,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:04,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 687 states and 861 transitions. [2018-12-09 05:02:04,726 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 861 transitions. [2018-12-09 05:02:04,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-09 05:02:04,726 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:04,770 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 05:02:04,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:04,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 688 states and 862 transitions. [2018-12-09 05:02:04,911 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 862 transitions. [2018-12-09 05:02:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-09 05:02:04,911 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:04,952 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 05:02:05,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:05,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 689 states and 862 transitions. [2018-12-09 05:02:05,101 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 862 transitions. [2018-12-09 05:02:05,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-09 05:02:05,101 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:05,400 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:02:07,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:07,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 754 states and 931 transitions. [2018-12-09 05:02:07,142 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 931 transitions. [2018-12-09 05:02:07,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-09 05:02:07,143 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:07,166 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 05:02:07,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 761 states and 938 transitions. [2018-12-09 05:02:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 938 transitions. [2018-12-09 05:02:07,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-09 05:02:07,193 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 05:02:07,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:07,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 768 states and 947 transitions. [2018-12-09 05:02:07,301 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 947 transitions. [2018-12-09 05:02:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-09 05:02:07,301 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 05:02:07,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 772 states and 953 transitions. [2018-12-09 05:02:07,559 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 953 transitions. [2018-12-09 05:02:07,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-09 05:02:07,560 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:07,577 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 05:02:07,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:07,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 783 states and 963 transitions. [2018-12-09 05:02:07,693 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 963 transitions. [2018-12-09 05:02:07,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-09 05:02:07,694 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:08,293 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:02:11,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:11,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 840 states and 1025 transitions. [2018-12-09 05:02:11,108 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1025 transitions. [2018-12-09 05:02:11,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-09 05:02:11,108 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:11,516 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:02:13,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:13,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 909 states and 1105 transitions. [2018-12-09 05:02:13,435 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1105 transitions. [2018-12-09 05:02:13,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-09 05:02:13,435 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:13,487 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-09 05:02:13,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:13,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 910 states and 1106 transitions. [2018-12-09 05:02:13,616 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1106 transitions. [2018-12-09 05:02:13,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-09 05:02:13,617 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:13,768 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:02:14,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:14,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 955 states and 1151 transitions. [2018-12-09 05:02:14,975 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1151 transitions. [2018-12-09 05:02:14,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-09 05:02:14,976 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:15,006 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:02:15,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:15,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 958 states and 1154 transitions. [2018-12-09 05:02:15,362 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1154 transitions. [2018-12-09 05:02:15,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-09 05:02:15,363 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:15,595 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 106 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 05:02:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:17,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 969 states and 1172 transitions. [2018-12-09 05:02:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1172 transitions. [2018-12-09 05:02:17,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-09 05:02:17,322 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:17,521 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:02:17,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:17,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 971 states and 1174 transitions. [2018-12-09 05:02:17,917 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1174 transitions. [2018-12-09 05:02:17,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-09 05:02:17,917 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:17,966 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:02:18,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:18,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1019 states and 1223 transitions. [2018-12-09 05:02:18,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1223 transitions. [2018-12-09 05:02:18,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-09 05:02:18,779 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:18,829 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:02:18,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:18,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1020 states and 1224 transitions. [2018-12-09 05:02:18,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1224 transitions. [2018-12-09 05:02:18,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-09 05:02:18,863 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:18,912 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:02:19,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:19,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1040 states and 1243 transitions. [2018-12-09 05:02:19,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1243 transitions. [2018-12-09 05:02:19,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-09 05:02:19,083 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:19,318 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 05:02:20,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:20,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1069 states and 1275 transitions. [2018-12-09 05:02:20,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1275 transitions. [2018-12-09 05:02:20,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-09 05:02:20,397 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:20,425 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 05:02:20,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:20,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1071 states and 1278 transitions. [2018-12-09 05:02:20,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1278 transitions. [2018-12-09 05:02:20,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-09 05:02:20,607 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:20,791 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-09 05:02:21,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1081 states and 1293 transitions. [2018-12-09 05:02:21,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1293 transitions. [2018-12-09 05:02:21,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-09 05:02:21,488 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:22,266 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 140 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:02:25,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:25,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1140 states and 1369 transitions. [2018-12-09 05:02:25,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1369 transitions. [2018-12-09 05:02:25,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-09 05:02:25,677 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-09 05:02:26,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:26,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1142 states and 1373 transitions. [2018-12-09 05:02:26,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1373 transitions. [2018-12-09 05:02:26,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-09 05:02:26,078 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-09 05:02:26,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:26,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1143 states and 1376 transitions. [2018-12-09 05:02:26,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1376 transitions. [2018-12-09 05:02:26,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-09 05:02:26,376 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-09 05:02:26,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1144 states and 1380 transitions. [2018-12-09 05:02:26,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1380 transitions. [2018-12-09 05:02:26,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-09 05:02:26,673 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:27,233 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 109 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:02:33,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:33,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1213 states and 1462 transitions. [2018-12-09 05:02:33,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1462 transitions. [2018-12-09 05:02:33,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-09 05:02:33,563 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:33,661 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 109 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:02:34,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:34,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1238 states and 1488 transitions. [2018-12-09 05:02:34,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1488 transitions. [2018-12-09 05:02:34,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-09 05:02:34,690 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:35,022 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-09 05:02:36,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1247 states and 1503 transitions. [2018-12-09 05:02:36,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1503 transitions. [2018-12-09 05:02:36,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-09 05:02:36,514 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:37,608 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 05:02:39,676 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2018-12-09 05:02:42,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1280 states and 1539 transitions. [2018-12-09 05:02:42,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1539 transitions. [2018-12-09 05:02:42,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-09 05:02:42,637 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:42,748 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 05:02:43,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:43,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1305 states and 1565 transitions. [2018-12-09 05:02:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1565 transitions. [2018-12-09 05:02:43,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-09 05:02:43,935 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:43,965 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-09 05:02:44,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:44,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1308 states and 1570 transitions. [2018-12-09 05:02:44,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1570 transitions. [2018-12-09 05:02:44,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-09 05:02:44,408 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:44,444 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-09 05:02:44,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1309 states and 1572 transitions. [2018-12-09 05:02:44,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1572 transitions. [2018-12-09 05:02:44,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-09 05:02:44,711 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:44,852 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 233 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-09 05:02:45,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:45,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1323 states and 1586 transitions. [2018-12-09 05:02:45,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1586 transitions. [2018-12-09 05:02:45,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-09 05:02:45,814 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:46,692 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 129 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:02:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:51,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1392 states and 1665 transitions. [2018-12-09 05:02:51,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1665 transitions. [2018-12-09 05:02:51,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-09 05:02:51,252 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:52,413 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 05:02:54,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:54,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1396 states and 1670 transitions. [2018-12-09 05:02:54,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1670 transitions. [2018-12-09 05:02:54,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-09 05:02:54,823 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:55,009 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-09 05:02:55,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:55,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1400 states and 1679 transitions. [2018-12-09 05:02:55,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1679 transitions. [2018-12-09 05:02:55,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-09 05:02:55,964 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:56,013 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-09 05:02:56,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:56,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1402 states and 1684 transitions. [2018-12-09 05:02:56,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1684 transitions. [2018-12-09 05:02:56,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-12-09 05:02:56,379 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 230 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 05:02:58,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:58,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1437 states and 1733 transitions. [2018-12-09 05:02:58,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1733 transitions. [2018-12-09 05:02:58,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-09 05:02:58,358 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:02:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-09 05:02:59,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:02:59,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1439 states and 1735 transitions. [2018-12-09 05:02:59,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1735 transitions. [2018-12-09 05:02:59,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-09 05:02:59,215 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:02:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:01,847 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 05:03:05,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:03:05,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1499 states and 1795 transitions. [2018-12-09 05:03:05,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1795 transitions. [2018-12-09 05:03:05,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-09 05:03:05,167 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:03:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:05,279 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-09 05:03:05,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:03:05,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1500 states and 1797 transitions. [2018-12-09 05:03:05,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1797 transitions. [2018-12-09 05:03:05,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-09 05:03:05,552 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:03:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-09 05:03:06,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:03:06,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1503 states and 1804 transitions. [2018-12-09 05:03:06,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1804 transitions. [2018-12-09 05:03:06,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-09 05:03:06,002 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:03:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:06,748 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 229 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 05:03:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:03:08,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1513 states and 1818 transitions. [2018-12-09 05:03:08,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1818 transitions. [2018-12-09 05:03:08,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-09 05:03:08,265 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:03:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 88 proven. 175 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 05:03:11,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:03:11,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1603 states and 1926 transitions. [2018-12-09 05:03:11,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 1926 transitions. [2018-12-09 05:03:11,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-09 05:03:11,330 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:03:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:12,651 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-09 05:03:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:03:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1623 states and 1958 transitions. [2018-12-09 05:03:17,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 1958 transitions. [2018-12-09 05:03:17,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-09 05:03:17,330 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:03:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:17,403 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-09 05:03:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:03:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1624 states and 1959 transitions. [2018-12-09 05:03:17,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 1959 transitions. [2018-12-09 05:03:17,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-09 05:03:17,826 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:03:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:18,030 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-09 05:03:19,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:03:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1643 states and 1984 transitions. [2018-12-09 05:03:19,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 1984 transitions. [2018-12-09 05:03:19,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-09 05:03:19,356 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:03:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-09 05:03:19,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:03:19,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1647 states and 1993 transitions. [2018-12-09 05:03:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 1993 transitions. [2018-12-09 05:03:19,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-09 05:03:19,724 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:03:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:19,771 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-09 05:03:20,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:03:20,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 1658 states and 2005 transitions. [2018-12-09 05:03:20,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2005 transitions. [2018-12-09 05:03:20,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-09 05:03:20,072 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:03:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-12-09 05:03:22,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:03:22,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 1685 states and 2046 transitions. [2018-12-09 05:03:22,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 2046 transitions. [2018-12-09 05:03:22,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-09 05:03:22,980 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:03:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:23,041 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-12-09 05:03:23,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:03:23,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 1686 states and 2047 transitions. [2018-12-09 05:03:23,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 2047 transitions. [2018-12-09 05:03:23,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-09 05:03:23,460 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:03:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-12-09 05:03:23,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:03:23,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 1687 states and 2050 transitions. [2018-12-09 05:03:23,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2050 transitions. [2018-12-09 05:03:23,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-09 05:03:23,756 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:03:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:23,809 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-12-09 05:03:27,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:03:27,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 1711 states and 2074 transitions. [2018-12-09 05:03:27,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2074 transitions. [2018-12-09 05:03:27,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-12-09 05:03:27,126 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:03:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:27,257 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 306 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-12-09 05:03:29,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:03:29,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 1753 states and 2129 transitions. [2018-12-09 05:03:29,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2129 transitions. [2018-12-09 05:03:29,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-12-09 05:03:29,471 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:03:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:30,773 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-09 05:03:34,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:03:34,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 1784 states and 2163 transitions. [2018-12-09 05:03:34,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2163 transitions. [2018-12-09 05:03:34,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-12-09 05:03:34,957 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:03:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-09 05:03:35,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:03:35,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 1785 states and 2163 transitions. [2018-12-09 05:03:35,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2163 transitions. [2018-12-09 05:03:35,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-12-09 05:03:35,511 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:03:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:35,625 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-09 05:03:38,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:03:38,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 1814 states and 2191 transitions. [2018-12-09 05:03:38,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2191 transitions. [2018-12-09 05:03:38,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-12-09 05:03:38,486 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:03:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 329 proven. 55 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 05:03:43,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:03:43,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 1850 states and 2243 transitions. [2018-12-09 05:03:43,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2243 transitions. [2018-12-09 05:03:43,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-12-09 05:03:43,174 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:03:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:43,224 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-12-09 05:03:43,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:03:43,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 1851 states and 2243 transitions. [2018-12-09 05:03:43,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2243 transitions. [2018-12-09 05:03:43,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-12-09 05:03:43,579 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:03:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:43,621 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-12-09 05:03:44,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:03:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 1858 states and 2250 transitions. [2018-12-09 05:03:44,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2250 transitions. [2018-12-09 05:03:44,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-12-09 05:03:44,404 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:03:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:45,821 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-09 05:03:50,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:03:50,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 1909 states and 2303 transitions. [2018-12-09 05:03:50,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1909 states and 2303 transitions. [2018-12-09 05:03:50,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-12-09 05:03:50,569 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:03:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:50,686 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-09 05:03:53,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:03:53,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 1931 states and 2324 transitions. [2018-12-09 05:03:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2324 transitions. [2018-12-09 05:03:53,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-12-09 05:03:53,015 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:03:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-09 05:03:53,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:03:53,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 1934 states and 2328 transitions. [2018-12-09 05:03:53,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2328 transitions. [2018-12-09 05:03:53,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-12-09 05:03:53,619 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:03:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:53,667 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-09 05:03:56,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:03:56,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 1973 states and 2366 transitions. [2018-12-09 05:03:56,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 2366 transitions. [2018-12-09 05:03:56,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-12-09 05:03:56,741 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:03:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:03:56,790 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-09 05:04:00,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:04:00,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2404 states to 2012 states and 2404 transitions. [2018-12-09 05:04:00,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2404 transitions. [2018-12-09 05:04:00,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-12-09 05:04:00,425 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:04:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:00,465 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-12-09 05:04:01,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:04:01,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2016 states and 2411 transitions. [2018-12-09 05:04:01,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 2411 transitions. [2018-12-09 05:04:01,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-12-09 05:04:01,279 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:04:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:01,326 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-12-09 05:04:01,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:04:01,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2017 states and 2412 transitions. [2018-12-09 05:04:01,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2412 transitions. [2018-12-09 05:04:01,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-12-09 05:04:01,625 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:04:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:01,727 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 164 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-09 05:04:08,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:04:08,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2088 states and 2495 transitions. [2018-12-09 05:04:08,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2495 transitions. [2018-12-09 05:04:08,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-12-09 05:04:08,426 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:04:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:08,483 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 164 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-09 05:04:10,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:04:10,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2127 states and 2537 transitions. [2018-12-09 05:04:10,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 2537 transitions. [2018-12-09 05:04:10,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-12-09 05:04:10,315 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:04:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-09 05:04:11,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:04:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2131 states and 2543 transitions. [2018-12-09 05:04:11,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2543 transitions. [2018-12-09 05:04:11,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-09 05:04:11,047 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:04:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:11,998 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 217 proven. 101 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-12-09 05:04:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:04:17,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2592 states to 2170 states and 2592 transitions. [2018-12-09 05:04:17,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2592 transitions. [2018-12-09 05:04:17,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-12-09 05:04:17,073 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:04:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:04:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:04:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:04:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:04:17,271 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 104 iterations. [2018-12-09 05:04:17,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.12 05:04:17 ImpRootNode [2018-12-09 05:04:17,406 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-09 05:04:17,406 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 05:04:17,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 05:04:17,407 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 05:04:17,407 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:01:54" (3/4) ... [2018-12-09 05:04:17,408 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 05:04:17,497 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_25ac477e-acd3-4d6d-92c7-d799064ee2ac/bin-2019/ukojak/witness.graphml [2018-12-09 05:04:17,497 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 05:04:17,498 INFO L168 Benchmark]: Toolchain (without parser) took 144690.99 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 946.3 MB in the beginning and 1.4 GB in the end (delta: -421.7 MB). Peak memory consumption was 674.6 MB. Max. memory is 11.5 GB. [2018-12-09 05:04:17,498 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:04:17,498 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -193.3 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. [2018-12-09 05:04:17,499 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.40 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-12-09 05:04:17,499 INFO L168 Benchmark]: Boogie Preprocessor took 42.55 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 05:04:17,499 INFO L168 Benchmark]: RCFGBuilder took 1037.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 918.0 MB in the end (delta: 205.6 MB). Peak memory consumption was 205.6 MB. Max. memory is 11.5 GB. [2018-12-09 05:04:17,499 INFO L168 Benchmark]: CodeCheck took 143115.45 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 944.8 MB). Free memory was 918.0 MB in the beginning and 1.4 GB in the end (delta: -496.1 MB). Peak memory consumption was 448.7 MB. Max. memory is 11.5 GB. [2018-12-09 05:04:17,499 INFO L168 Benchmark]: Witness Printer took 90.72 ms. Allocated memory is still 2.1 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. [2018-12-09 05:04:17,501 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 198 locations, 1 error locations. UNSAFE Result, 142.9s OverallTime, 104 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 906496040 SDtfs, -2113954848 SDslu, 1875709168 SDs, 0 SdLazy, -1979114442 SolverSat, -1967183430 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 317.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114116 GetRequests, 110410 SyntacticMatches, 2422 SemanticMatches, 1284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1231504 ImplicationChecksByTransitivity, 127.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 18.8s InterpolantComputationTime, 17493 NumberOfCodeBlocks, 17493 NumberOfCodeBlocksAsserted, 104 NumberOfCheckSat, 17147 ConstructedInterpolants, 0 QuantifiedInterpolants, 15250502 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 103 InterpolantComputations, 84 PerfectInterpolantSequences, 16735/17256 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: 398]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND TRUE ((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))) [L149] a16 = 4 [L150] a17 = 0 [L151] return 25; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND TRUE (((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1)) [L130] a8 = 15 [L131] a17 = 0 [L132] a21 = 1 [L133] a20 = 0 [L134] a16 = 4 [L135] return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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 FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, 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))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L397] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L398] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 349.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -193.3 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.40 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. * Boogie Preprocessor took 42.55 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1037.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 918.0 MB in the end (delta: 205.6 MB). Peak memory consumption was 205.6 MB. Max. memory is 11.5 GB. * CodeCheck took 143115.45 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 944.8 MB). Free memory was 918.0 MB in the beginning and 1.4 GB in the end (delta: -496.1 MB). Peak memory consumption was 448.7 MB. Max. memory is 11.5 GB. * Witness Printer took 90.72 ms. Allocated memory is still 2.1 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...