./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d15cd24b-6b52-4968-a5ee-a29599fb5e21/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d15cd24b-6b52-4968-a5ee-a29599fb5e21/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d15cd24b-6b52-4968-a5ee-a29599fb5e21/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d15cd24b-6b52-4968-a5ee-a29599fb5e21/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label20.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d15cd24b-6b52-4968-a5ee-a29599fb5e21/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d15cd24b-6b52-4968-a5ee-a29599fb5e21/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aaa39ce28677c06ea4974c4267a7bbc4385d14ab .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.25-f470102 [2019-12-01 19:53:04,138 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-01 19:53:04,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-01 19:53:04,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-01 19:53:04,147 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-01 19:53:04,148 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-01 19:53:04,149 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-01 19:53:04,150 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-01 19:53:04,151 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-01 19:53:04,152 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-01 19:53:04,153 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-01 19:53:04,153 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-01 19:53:04,154 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-01 19:53:04,154 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-01 19:53:04,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-01 19:53:04,156 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-01 19:53:04,156 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-01 19:53:04,157 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-01 19:53:04,158 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-01 19:53:04,160 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-01 19:53:04,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-01 19:53:04,161 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-01 19:53:04,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-01 19:53:04,163 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-01 19:53:04,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-01 19:53:04,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-01 19:53:04,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-01 19:53:04,165 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-01 19:53:04,165 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-01 19:53:04,166 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-01 19:53:04,166 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-01 19:53:04,166 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-01 19:53:04,167 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-01 19:53:04,167 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-01 19:53:04,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-01 19:53:04,168 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-01 19:53:04,168 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-01 19:53:04,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-01 19:53:04,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-01 19:53:04,169 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-01 19:53:04,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-01 19:53:04,170 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d15cd24b-6b52-4968-a5ee-a29599fb5e21/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-12-01 19:53:04,179 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-01 19:53:04,180 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-01 19:53:04,180 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-01 19:53:04,180 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-01 19:53:04,181 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-01 19:53:04,181 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-01 19:53:04,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-01 19:53:04,181 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-01 19:53:04,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-01 19:53:04,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-01 19:53:04,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-01 19:53:04,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-01 19:53:04,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-01 19:53:04,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-01 19:53:04,182 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-01 19:53:04,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-01 19:53:04,182 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-01 19:53:04,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-01 19:53:04,183 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-01 19:53:04,183 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-01 19:53:04,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-01 19:53:04,183 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-01 19:53:04,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-01 19:53:04,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-01 19:53:04,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-01 19:53:04,183 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-01 19:53:04,184 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-12-01 19:53:04,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-01 19:53:04,184 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-01 19:53:04,184 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_d15cd24b-6b52-4968-a5ee-a29599fb5e21/bin/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aaa39ce28677c06ea4974c4267a7bbc4385d14ab [2019-12-01 19:53:04,282 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-01 19:53:04,289 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-01 19:53:04,292 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-01 19:53:04,293 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-01 19:53:04,293 INFO L275 PluginConnector]: CDTParser initialized [2019-12-01 19:53:04,293 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d15cd24b-6b52-4968-a5ee-a29599fb5e21/bin/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label20.c [2019-12-01 19:53:04,331 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d15cd24b-6b52-4968-a5ee-a29599fb5e21/bin/ukojak/data/3f265a4b0/2d07cb3e3cf3424383efed1d3577b203/FLAG62ac78413 [2019-12-01 19:53:04,717 INFO L306 CDTParser]: Found 1 translation units. [2019-12-01 19:53:04,717 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d15cd24b-6b52-4968-a5ee-a29599fb5e21/sv-benchmarks/c/eca-rers2012/Problem01_label20.c [2019-12-01 19:53:04,726 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d15cd24b-6b52-4968-a5ee-a29599fb5e21/bin/ukojak/data/3f265a4b0/2d07cb3e3cf3424383efed1d3577b203/FLAG62ac78413 [2019-12-01 19:53:04,735 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d15cd24b-6b52-4968-a5ee-a29599fb5e21/bin/ukojak/data/3f265a4b0/2d07cb3e3cf3424383efed1d3577b203 [2019-12-01 19:53:04,737 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-01 19:53:04,737 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-01 19:53:04,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-01 19:53:04,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-01 19:53:04,740 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-01 19:53:04,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:53:04" (1/1) ... [2019-12-01 19:53:04,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c51c803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:53:04, skipping insertion in model container [2019-12-01 19:53:04,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:53:04" (1/1) ... [2019-12-01 19:53:04,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-01 19:53:04,779 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-01 19:53:05,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 19:53:05,032 INFO L203 MainTranslator]: Completed pre-run [2019-12-01 19:53:05,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 19:53:05,110 INFO L208 MainTranslator]: Completed translation [2019-12-01 19:53:05,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:53:05 WrapperNode [2019-12-01 19:53:05,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-01 19:53:05,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-01 19:53:05,111 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-01 19:53:05,111 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-01 19:53:05,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:53:05" (1/1) ... [2019-12-01 19:53:05,129 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:53:05" (1/1) ... [2019-12-01 19:53:05,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-01 19:53:05,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-01 19:53:05,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-01 19:53:05,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-01 19:53:05,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:53:05" (1/1) ... [2019-12-01 19:53:05,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:53:05" (1/1) ... [2019-12-01 19:53:05,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:53:05" (1/1) ... [2019-12-01 19:53:05,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:53:05" (1/1) ... [2019-12-01 19:53:05,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:53:05" (1/1) ... [2019-12-01 19:53:05,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:53:05" (1/1) ... [2019-12-01 19:53:05,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:53:05" (1/1) ... [2019-12-01 19:53:05,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-01 19:53:05,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-01 19:53:05,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-01 19:53:05,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-01 19:53:05,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:53:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d15cd24b-6b52-4968-a5ee-a29599fb5e21/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-01 19:53:05,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-01 19:53:05,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-01 19:53:06,362 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-01 19:53:06,362 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-01 19:53:06,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:53:06 BoogieIcfgContainer [2019-12-01 19:53:06,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-01 19:53:06,364 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-01 19:53:06,364 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-01 19:53:06,373 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-01 19:53:06,374 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:53:06" (1/1) ... [2019-12-01 19:53:06,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-01 19:53:06,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:06,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2019-12-01 19:53:06,408 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2019-12-01 19:53:06,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-01 19:53:06,411 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:06,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 19:53:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:06,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 145 states and 221 transitions. [2019-12-01 19:53:06,967 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 221 transitions. [2019-12-01 19:53:06,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-01 19:53:06,970 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:07,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 19:53:07,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:07,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 149 states and 226 transitions. [2019-12-01 19:53:07,173 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 226 transitions. [2019-12-01 19:53:07,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-01 19:53:07,175 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:07,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 19:53:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:07,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 154 states and 236 transitions. [2019-12-01 19:53:07,307 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 236 transitions. [2019-12-01 19:53:07,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-01 19:53:07,308 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:07,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 19:53:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 230 states and 325 transitions. [2019-12-01 19:53:07,845 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 325 transitions. [2019-12-01 19:53:07,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-01 19:53:07,849 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:07,898 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 19:53:08,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 252 states and 354 transitions. [2019-12-01 19:53:08,268 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 354 transitions. [2019-12-01 19:53:08,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-01 19:53:08,270 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:08,440 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-01 19:53:08,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:08,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 262 states and 370 transitions. [2019-12-01 19:53:08,908 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 370 transitions. [2019-12-01 19:53:08,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-01 19:53:08,910 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:08,955 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 19:53:08,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:08,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 267 states and 375 transitions. [2019-12-01 19:53:08,987 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 375 transitions. [2019-12-01 19:53:08,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-01 19:53:08,988 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:09,060 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-01 19:53:09,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:09,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 278 states and 397 transitions. [2019-12-01 19:53:09,646 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 397 transitions. [2019-12-01 19:53:09,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-01 19:53:09,648 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:09,677 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-01 19:53:10,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:10,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 284 states and 406 transitions. [2019-12-01 19:53:10,107 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 406 transitions. [2019-12-01 19:53:10,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-01 19:53:10,109 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-01 19:53:10,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:10,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 290 states and 415 transitions. [2019-12-01 19:53:10,397 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 415 transitions. [2019-12-01 19:53:10,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-01 19:53:10,398 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:10,418 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-01 19:53:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:10,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 293 states and 419 transitions. [2019-12-01 19:53:10,528 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 419 transitions. [2019-12-01 19:53:10,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-01 19:53:10,529 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:10,548 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-01 19:53:10,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:10,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 295 states and 421 transitions. [2019-12-01 19:53:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 421 transitions. [2019-12-01 19:53:10,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-01 19:53:10,679 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:10,698 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-01 19:53:10,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 298 states and 424 transitions. [2019-12-01 19:53:10,824 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 424 transitions. [2019-12-01 19:53:10,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-01 19:53:10,825 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:10,846 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 19:53:10,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:10,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 304 states and 430 transitions. [2019-12-01 19:53:10,880 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 430 transitions. [2019-12-01 19:53:10,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-01 19:53:10,880 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:10,906 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-01 19:53:11,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:11,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 310 states and 441 transitions. [2019-12-01 19:53:11,420 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 441 transitions. [2019-12-01 19:53:11,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-01 19:53:11,421 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:11,458 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-01 19:53:11,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:11,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 313 states and 445 transitions. [2019-12-01 19:53:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 445 transitions. [2019-12-01 19:53:11,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-01 19:53:11,715 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-01 19:53:11,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 316 states and 451 transitions. [2019-12-01 19:53:11,855 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 451 transitions. [2019-12-01 19:53:11,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-01 19:53:11,856 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:11,881 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-01 19:53:12,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:12,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 319 states and 454 transitions. [2019-12-01 19:53:12,055 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 454 transitions. [2019-12-01 19:53:12,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-01 19:53:12,057 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:12,114 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-01 19:53:12,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:12,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 321 states and 457 transitions. [2019-12-01 19:53:12,277 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 457 transitions. [2019-12-01 19:53:12,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-01 19:53:12,278 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:12,384 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-01 19:53:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 326 states and 464 transitions. [2019-12-01 19:53:12,885 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 464 transitions. [2019-12-01 19:53:12,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-01 19:53:12,885 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:12,910 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-12-01 19:53:13,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:13,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 337 states and 480 transitions. [2019-12-01 19:53:13,697 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 480 transitions. [2019-12-01 19:53:13,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-01 19:53:13,699 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:13,727 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-12-01 19:53:13,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 340 states and 483 transitions. [2019-12-01 19:53:13,879 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 483 transitions. [2019-12-01 19:53:13,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-01 19:53:13,880 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:13,984 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-01 19:53:14,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:14,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 348 states and 498 transitions. [2019-12-01 19:53:14,534 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 498 transitions. [2019-12-01 19:53:14,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-01 19:53:14,535 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:14,557 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-01 19:53:14,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:14,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 353 states and 507 transitions. [2019-12-01 19:53:14,827 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 507 transitions. [2019-12-01 19:53:14,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-01 19:53:14,827 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:14,847 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-01 19:53:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:14,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 356 states and 513 transitions. [2019-12-01 19:53:14,994 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 513 transitions. [2019-12-01 19:53:14,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-01 19:53:14,995 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:15,022 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 19:53:15,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:15,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 370 states and 527 transitions. [2019-12-01 19:53:15,076 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 527 transitions. [2019-12-01 19:53:15,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-01 19:53:15,077 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-01 19:53:15,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:15,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 381 states and 539 transitions. [2019-12-01 19:53:15,293 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 539 transitions. [2019-12-01 19:53:15,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-01 19:53:15,294 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 19:53:15,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 426 states and 588 transitions. [2019-12-01 19:53:15,864 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 588 transitions. [2019-12-01 19:53:15,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-12-01 19:53:15,865 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-12-01 19:53:16,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:16,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 428 states and 591 transitions. [2019-12-01 19:53:16,081 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 591 transitions. [2019-12-01 19:53:16,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-12-01 19:53:16,081 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:16,105 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 19:53:16,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:16,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 435 states and 600 transitions. [2019-12-01 19:53:16,295 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 600 transitions. [2019-12-01 19:53:16,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-01 19:53:16,296 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:16,365 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-01 19:53:16,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:16,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 453 states and 619 transitions. [2019-12-01 19:53:16,888 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 619 transitions. [2019-12-01 19:53:16,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-12-01 19:53:16,888 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:17,139 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-01 19:53:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 481 states and 661 transitions. [2019-12-01 19:53:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 661 transitions. [2019-12-01 19:53:19,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-12-01 19:53:19,334 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:19,377 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-01 19:53:20,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:20,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 490 states and 670 transitions. [2019-12-01 19:53:20,415 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 670 transitions. [2019-12-01 19:53:20,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-12-01 19:53:20,416 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 19:53:22,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:22,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 555 states and 737 transitions. [2019-12-01 19:53:22,535 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 737 transitions. [2019-12-01 19:53:22,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-12-01 19:53:22,536 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:23,241 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 19:53:24,183 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-12-01 19:53:25,478 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-12-01 19:53:27,260 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2019-12-01 19:53:28,009 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-12-01 19:53:29,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:29,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 611 states and 798 transitions. [2019-12-01 19:53:29,825 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 798 transitions. [2019-12-01 19:53:29,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-12-01 19:53:29,826 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 19:53:32,105 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2019-12-01 19:53:33,613 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 31 [2019-12-01 19:53:37,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:37,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 679 states and 881 transitions. [2019-12-01 19:53:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 881 transitions. [2019-12-01 19:53:37,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-12-01 19:53:37,909 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:37,999 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 19:53:38,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:38,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 687 states and 889 transitions. [2019-12-01 19:53:38,798 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 889 transitions. [2019-12-01 19:53:38,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-01 19:53:38,799 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:38,849 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-12-01 19:53:38,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:38,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 688 states and 889 transitions. [2019-12-01 19:53:38,978 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 889 transitions. [2019-12-01 19:53:38,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-01 19:53:38,978 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:39,212 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 19:53:40,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:40,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 757 states and 963 transitions. [2019-12-01 19:53:40,409 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 963 transitions. [2019-12-01 19:53:40,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-01 19:53:40,410 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:40,679 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 106 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-01 19:53:42,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:42,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 766 states and 978 transitions. [2019-12-01 19:53:42,390 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 978 transitions. [2019-12-01 19:53:42,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-01 19:53:42,392 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:42,442 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 106 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-01 19:53:42,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 771 states and 984 transitions. [2019-12-01 19:53:42,779 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 984 transitions. [2019-12-01 19:53:42,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-01 19:53:42,780 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:43,012 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 19:53:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:44,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 842 states and 1055 transitions. [2019-12-01 19:53:44,937 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1055 transitions. [2019-12-01 19:53:44,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-01 19:53:44,938 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:44,967 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-12-01 19:53:45,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:45,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 855 states and 1073 transitions. [2019-12-01 19:53:45,733 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1073 transitions. [2019-12-01 19:53:45,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-01 19:53:45,737 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:45,773 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-12-01 19:53:46,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:46,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 857 states and 1074 transitions. [2019-12-01 19:53:46,015 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1074 transitions. [2019-12-01 19:53:46,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-01 19:53:46,016 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:46,218 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-01 19:53:47,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 865 states and 1087 transitions. [2019-12-01 19:53:47,151 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1087 transitions. [2019-12-01 19:53:47,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-01 19:53:47,153 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:47,217 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-01 19:53:47,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:47,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 868 states and 1091 transitions. [2019-12-01 19:53:47,459 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1091 transitions. [2019-12-01 19:53:47,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-01 19:53:47,460 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:47,504 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-01 19:53:47,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:47,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 870 states and 1094 transitions. [2019-12-01 19:53:47,686 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1094 transitions. [2019-12-01 19:53:47,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-01 19:53:47,687 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:48,563 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 155 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-01 19:53:51,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 884 states and 1111 transitions. [2019-12-01 19:53:51,462 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1111 transitions. [2019-12-01 19:53:51,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-01 19:53:51,463 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:51,555 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 155 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-01 19:53:52,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:52,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 886 states and 1112 transitions. [2019-12-01 19:53:52,312 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1112 transitions. [2019-12-01 19:53:52,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-12-01 19:53:52,313 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-01 19:53:52,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:53:52,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 888 states and 1114 transitions. [2019-12-01 19:53:52,430 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1114 transitions. [2019-12-01 19:53:52,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-12-01 19:53:52,431 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:53:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:53:53,262 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 109 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 19:53:57,436 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2019-12-01 19:53:58,302 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-12-01 19:53:59,580 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-12-01 19:54:04,122 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2019-12-01 19:54:04,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:54:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 957 states and 1198 transitions. [2019-12-01 19:54:04,806 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1198 transitions. [2019-12-01 19:54:04,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-12-01 19:54:04,807 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:54:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:54:04,950 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 109 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 19:54:06,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:54:06,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 963 states and 1203 transitions. [2019-12-01 19:54:06,623 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1203 transitions. [2019-12-01 19:54:06,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-12-01 19:54:06,624 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:54:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:54:07,641 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-01 19:54:11,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:54:11,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 970 states and 1221 transitions. [2019-12-01 19:54:11,425 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1221 transitions. [2019-12-01 19:54:11,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-12-01 19:54:11,427 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:54:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:54:11,469 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-01 19:54:15,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:54:15,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 976 states and 1233 transitions. [2019-12-01 19:54:15,054 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1233 transitions. [2019-12-01 19:54:15,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-12-01 19:54:15,056 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:54:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:54:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-01 19:54:15,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:54:15,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 977 states and 1233 transitions. [2019-12-01 19:54:15,392 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1233 transitions. [2019-12-01 19:54:15,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-12-01 19:54:15,393 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:54:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:54:15,439 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-12-01 19:54:16,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:54:16,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 980 states and 1237 transitions. [2019-12-01 19:54:16,158 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1237 transitions. [2019-12-01 19:54:16,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-12-01 19:54:16,160 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:54:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:54:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-01 19:54:17,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:54:17,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1025 states and 1289 transitions. [2019-12-01 19:54:17,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1289 transitions. [2019-12-01 19:54:17,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-12-01 19:54:17,821 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:54:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:54:17,867 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-01 19:54:18,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:54:18,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1028 states and 1293 transitions. [2019-12-01 19:54:18,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1293 transitions. [2019-12-01 19:54:18,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-12-01 19:54:18,110 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:54:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:54:18,154 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-01 19:54:18,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:54:18,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1031 states and 1296 transitions. [2019-12-01 19:54:18,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1296 transitions. [2019-12-01 19:54:18,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-12-01 19:54:18,417 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:54:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:54:18,586 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 233 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-01 19:54:19,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:54:19,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1037 states and 1303 transitions. [2019-12-01 19:54:19,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1303 transitions. [2019-12-01 19:54:19,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-12-01 19:54:19,536 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:54:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:54:19,598 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 233 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-01 19:54:20,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:54:20,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1040 states and 1306 transitions. [2019-12-01 19:54:20,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1306 transitions. [2019-12-01 19:54:20,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-12-01 19:54:20,018 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:54:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:54:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-12-01 19:54:21,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:54:21,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1070 states and 1340 transitions. [2019-12-01 19:54:21,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1340 transitions. [2019-12-01 19:54:21,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-12-01 19:54:21,846 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:54:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:54:24,220 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 129 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 19:54:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:54:34,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1139 states and 1429 transitions. [2019-12-01 19:54:34,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1429 transitions. [2019-12-01 19:54:34,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-12-01 19:54:34,264 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:54:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:54:34,527 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 129 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 19:54:38,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:54:38,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1158 states and 1452 transitions. [2019-12-01 19:54:38,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1452 transitions. [2019-12-01 19:54:38,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-12-01 19:54:38,384 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:54:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:54:38,659 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 129 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 19:54:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:54:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1172 states and 1466 transitions. [2019-12-01 19:54:41,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1466 transitions. [2019-12-01 19:54:41,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-12-01 19:54:41,613 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:54:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:54:41,881 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 129 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 19:54:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:54:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1174 states and 1467 transitions. [2019-12-01 19:54:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1467 transitions. [2019-12-01 19:54:42,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-12-01 19:54:42,349 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:54:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:54:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-12-01 19:54:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:54:44,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1213 states and 1509 transitions. [2019-12-01 19:54:44,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1509 transitions. [2019-12-01 19:54:44,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-12-01 19:54:44,533 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:54:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:54:44,602 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-12-01 19:54:45,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:54:45,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1215 states and 1510 transitions. [2019-12-01 19:54:45,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1510 transitions. [2019-12-01 19:54:45,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-12-01 19:54:45,546 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:54:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:54:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-01 19:54:49,127 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-12-01 19:54:50,255 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-12-01 19:54:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:54:53,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1219 states and 1517 transitions. [2019-12-01 19:54:53,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1517 transitions. [2019-12-01 19:54:53,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-12-01 19:54:53,568 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:54:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:54:53,921 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-01 19:54:54,177 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2019-12-01 19:54:56,072 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-12-01 19:54:56,521 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-12-01 19:54:57,524 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-12-01 19:54:58,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:54:58,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1222 states and 1521 transitions. [2019-12-01 19:54:58,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1521 transitions. [2019-12-01 19:54:58,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-12-01 19:54:58,468 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:54:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:54:58,519 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-01 19:55:00,118 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-12-01 19:55:03,187 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-12-01 19:55:06,918 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-12-01 19:55:07,262 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2019-12-01 19:55:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:55:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1280 states and 1587 transitions. [2019-12-01 19:55:08,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1587 transitions. [2019-12-01 19:55:08,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-12-01 19:55:08,726 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:55:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:55:08,777 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-01 19:55:09,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:55:09,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1282 states and 1588 transitions. [2019-12-01 19:55:09,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1588 transitions. [2019-12-01 19:55:09,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-12-01 19:55:09,306 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:55:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:55:09,373 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-12-01 19:55:10,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:55:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1352 states and 1661 transitions. [2019-12-01 19:55:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1661 transitions. [2019-12-01 19:55:10,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-12-01 19:55:10,117 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:55:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:55:10,489 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 240 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-01 19:55:17,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:55:17,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1390 states and 1712 transitions. [2019-12-01 19:55:17,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1712 transitions. [2019-12-01 19:55:17,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-12-01 19:55:17,222 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:55:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:55:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 240 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-01 19:55:18,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:55:18,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1398 states and 1722 transitions. [2019-12-01 19:55:18,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1722 transitions. [2019-12-01 19:55:18,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-12-01 19:55:18,195 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:55:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:55:18,270 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 240 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-01 19:55:18,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:55:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1400 states and 1725 transitions. [2019-12-01 19:55:18,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1725 transitions. [2019-12-01 19:55:18,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-12-01 19:55:18,305 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:55:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:55:22,277 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-12-01 19:55:28,463 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-01 19:55:30,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:55:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1448 states and 1776 transitions. [2019-12-01 19:55:30,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1776 transitions. [2019-12-01 19:55:30,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-12-01 19:55:30,493 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:55:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:55:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-12-01 19:55:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:55:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1450 states and 1776 transitions. [2019-12-01 19:55:33,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 1776 transitions. [2019-12-01 19:55:33,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-12-01 19:55:33,017 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:55:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:55:35,008 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 239 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-01 19:55:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:55:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1499 states and 1829 transitions. [2019-12-01 19:55:40,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1829 transitions. [2019-12-01 19:55:40,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-12-01 19:55:40,462 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:55:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:55:40,744 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 239 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-01 19:55:41,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:55:41,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1504 states and 1833 transitions. [2019-12-01 19:55:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1833 transitions. [2019-12-01 19:55:41,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-12-01 19:55:41,742 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:55:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:55:42,154 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-01 19:55:43,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:55:43,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1574 states and 1907 transitions. [2019-12-01 19:55:43,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 1907 transitions. [2019-12-01 19:55:43,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-12-01 19:55:43,822 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:55:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:55:44,430 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 164 proven. 1 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-12-01 19:55:48,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:55:48,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1599 states and 1937 transitions. [2019-12-01 19:55:48,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 1937 transitions. [2019-12-01 19:55:48,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-12-01 19:55:48,361 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:55:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:55:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 164 proven. 1 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-12-01 19:55:49,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:55:49,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1601 states and 1938 transitions. [2019-12-01 19:55:49,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 1938 transitions. [2019-12-01 19:55:49,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-12-01 19:55:49,262 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:55:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:55:49,607 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-12-01 19:55:51,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:55:51,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 1697 states and 2041 transitions. [2019-12-01 19:55:51,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 2041 transitions. [2019-12-01 19:55:51,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-12-01 19:55:51,017 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:55:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:55:52,311 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 256 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-12-01 19:55:59,176 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2019-12-01 19:56:00,931 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-12-01 19:56:03,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:56:03,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 1727 states and 2082 transitions. [2019-12-01 19:56:03,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2082 transitions. [2019-12-01 19:56:03,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-12-01 19:56:03,260 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:56:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:56:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 256 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-12-01 19:56:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:56:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 1732 states and 2087 transitions. [2019-12-01 19:56:04,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2087 transitions. [2019-12-01 19:56:04,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-12-01 19:56:04,943 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:56:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:56:07,581 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 221 proven. 128 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-01 19:56:15,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:56:15,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 1778 states and 2148 transitions. [2019-12-01 19:56:15,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2148 transitions. [2019-12-01 19:56:15,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-12-01 19:56:15,928 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:56:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:56:16,078 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 221 proven. 128 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-01 19:56:17,873 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-12-01 19:56:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:56:19,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 1794 states and 2165 transitions. [2019-12-01 19:56:19,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 2165 transitions. [2019-12-01 19:56:19,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-12-01 19:56:19,892 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:56:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:56:22,360 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 368 proven. 18 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-12-01 19:56:50,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:56:50,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 1908 states and 2333 transitions. [2019-12-01 19:56:50,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2333 transitions. [2019-12-01 19:56:50,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-12-01 19:56:50,176 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:56:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:56:52,826 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-12-01 19:56:59,474 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-12-01 19:57:04,245 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 31 [2019-12-01 19:57:09,436 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 30 [2019-12-01 19:57:10,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:57:10,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 1977 states and 2408 transitions. [2019-12-01 19:57:10,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2408 transitions. [2019-12-01 19:57:10,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-12-01 19:57:10,530 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:57:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:57:10,758 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-12-01 19:57:14,225 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-01 19:57:15,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:57:15,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 1984 states and 2419 transitions. [2019-12-01 19:57:15,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 2419 transitions. [2019-12-01 19:57:15,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-12-01 19:57:15,571 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:57:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:57:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-12-01 19:57:18,000 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2019-12-01 19:57:25,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:57:25,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2012 states and 2449 transitions. [2019-12-01 19:57:25,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2449 transitions. [2019-12-01 19:57:25,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-12-01 19:57:25,326 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:57:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:57:26,306 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-12-01 19:57:26,881 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2019-12-01 19:57:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:57:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2015 states and 2453 transitions. [2019-12-01 19:57:28,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2453 transitions. [2019-12-01 19:57:28,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-12-01 19:57:28,294 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:57:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:57:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-12-01 19:57:31,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:57:31,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2024 states and 2465 transitions. [2019-12-01 19:57:31,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2465 transitions. [2019-12-01 19:57:31,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-12-01 19:57:31,708 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:57:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:57:32,119 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-12-01 19:57:33,702 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2019-12-01 19:57:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:57:34,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2029 states and 2469 transitions. [2019-12-01 19:57:34,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 2469 transitions. [2019-12-01 19:57:34,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-12-01 19:57:34,955 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:57:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:57:35,612 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-12-01 19:57:48,261 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-12-01 19:57:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:57:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2114 states and 2567 transitions. [2019-12-01 19:57:49,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 2567 transitions. [2019-12-01 19:57:49,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-12-01 19:57:49,073 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:57:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:57:49,284 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-12-01 19:57:52,119 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-12-01 19:57:53,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:57:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2574 states to 2122 states and 2574 transitions. [2019-12-01 19:57:53,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 2574 transitions. [2019-12-01 19:57:53,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-12-01 19:57:53,338 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:57:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:57:53,526 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-12-01 19:57:59,781 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-12-01 19:58:04,449 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2019-12-01 19:58:05,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:58:05,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2632 states to 2168 states and 2632 transitions. [2019-12-01 19:58:05,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 2632 transitions. [2019-12-01 19:58:05,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-12-01 19:58:05,251 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:58:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:58:09,314 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-01 19:58:17,176 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-12-01 19:58:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:58:21,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2198 states and 2667 transitions. [2019-12-01 19:58:21,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 2667 transitions. [2019-12-01 19:58:21,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-12-01 19:58:21,689 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:58:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:58:25,847 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-01 19:58:31,585 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2019-12-01 19:58:33,986 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2019-12-01 19:58:35,281 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-12-01 19:58:36,576 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2019-12-01 19:58:38,032 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-12-01 19:58:39,995 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-12-01 19:58:41,106 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-12-01 19:58:42,481 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-12-01 19:58:45,357 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-12-01 19:58:47,110 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-01 19:58:53,136 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-12-01 19:58:55,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:58:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2247 states and 2723 transitions. [2019-12-01 19:58:55,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 2723 transitions. [2019-12-01 19:58:55,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-12-01 19:58:55,061 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:58:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:58:55,292 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-01 19:58:57,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:58:57,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2250 states and 2726 transitions. [2019-12-01 19:58:57,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 2726 transitions. [2019-12-01 19:58:57,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-12-01 19:58:57,635 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:58:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:58:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-01 19:59:01,731 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-01 19:59:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:59:01,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2253 states and 2729 transitions. [2019-12-01 19:59:01,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 2729 transitions. [2019-12-01 19:59:01,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-12-01 19:59:01,829 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:59:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:59:09,484 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-01 19:59:22,649 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-12-01 19:59:27,685 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-12-01 19:59:31,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:59:31,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2776 states to 2297 states and 2776 transitions. [2019-12-01 19:59:31,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2297 states and 2776 transitions. [2019-12-01 19:59:31,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-12-01 19:59:31,038 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:59:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:59:31,841 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-01 19:59:33,544 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-01 19:59:35,523 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2019-12-01 19:59:36,130 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-12-01 19:59:38,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:59:38,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2780 states to 2300 states and 2780 transitions. [2019-12-01 19:59:38,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2300 states and 2780 transitions. [2019-12-01 19:59:38,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-12-01 19:59:38,614 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:59:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:59:39,771 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-01 19:59:41,130 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-12-01 19:59:42,288 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-12-01 19:59:44,132 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-12-01 19:59:46,193 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-12-01 19:59:47,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:59:47,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2317 states and 2798 transitions. [2019-12-01 19:59:47,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 2798 transitions. [2019-12-01 19:59:47,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-12-01 19:59:47,682 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:59:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:59:48,258 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-01 19:59:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:59:50,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2324 states and 2805 transitions. [2019-12-01 19:59:50,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 2805 transitions. [2019-12-01 19:59:50,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-12-01 19:59:50,185 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:59:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 19:59:50,719 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-01 19:59:52,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 19:59:52,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2329 states and 2809 transitions. [2019-12-01 19:59:52,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 2809 transitions. [2019-12-01 19:59:52,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-12-01 19:59:52,558 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 19:59:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 19:59:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 19:59:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 19:59:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 19:59:52,832 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 108 iterations. [2019-12-01 19:59:52,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 07:59:52 ImpRootNode [2019-12-01 19:59:52,985 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-12-01 19:59:52,985 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-01 19:59:52,985 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-01 19:59:52,986 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-01 19:59:52,986 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:53:06" (3/4) ... [2019-12-01 19:59:52,988 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-01 19:59:53,120 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d15cd24b-6b52-4968-a5ee-a29599fb5e21/bin/ukojak/witness.graphml [2019-12-01 19:59:53,120 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-01 19:59:53,121 INFO L168 Benchmark]: Toolchain (without parser) took 408383.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.2 MB). Free memory was 932.8 MB in the beginning and 835.1 MB in the end (delta: 97.6 MB). Peak memory consumption was 651.6 MB. Max. memory is 11.5 GB. [2019-12-01 19:59:53,121 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-01 19:59:53,121 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 932.8 MB in the beginning and 1.1 GB in the end (delta: -145.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-01 19:59:53,122 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.72 ms. Allocated memory is still 1.1 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. [2019-12-01 19:59:53,122 INFO L168 Benchmark]: Boogie Preprocessor took 38.28 ms. Allocated memory is still 1.1 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. [2019-12-01 19:59:53,122 INFO L168 Benchmark]: RCFGBuilder took 1160.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 853.3 MB in the end (delta: 213.7 MB). Peak memory consumption was 213.7 MB. Max. memory is 11.5 GB. [2019-12-01 19:59:53,122 INFO L168 Benchmark]: CodeCheck took 406621.41 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 104.3 MB). Free memory was 853.3 MB in the beginning and 508.0 MB in the end (delta: 345.4 MB). Peak memory consumption was 449.7 MB. Max. memory is 11.5 GB. [2019-12-01 19:59:53,122 INFO L168 Benchmark]: Witness Printer took 134.60 ms. Allocated memory is still 1.2 GB. Free memory was 508.0 MB in the beginning and 835.1 MB in the end (delta: -327.2 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-12-01 19:59:53,124 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: UNSAFE, OverallTime: 406.4s, OverallIterations: 108, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1982421424 SDtfs, 1773827220 SDslu, 105858576 SDs, 0 SdLazy, -344174396 SolverSat, 300935624 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 536.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128071 GetRequests, 122677 SyntacticMatches, 3780 SemanticMatches, 1614 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1979738 ImplicationChecksByTransitivity, 376.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.5s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 48.3s InterpolantComputationTime, 19363 NumberOfCodeBlocks, 19363 NumberOfCodeBlocksAsserted, 108 NumberOfCheckSat, 18973 ConstructedInterpolants, 0 QuantifiedInterpolants, 26824501 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 107 InterpolantComputations, 83 PerfectInterpolantSequences, 21031/21649 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 392]: 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 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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=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] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=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] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=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] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=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] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=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] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=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] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=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] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND 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=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] [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=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] [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=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] [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=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] [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=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] [L261] COND TRUE ((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5)) [L262] a16 = 4 [L263] a20 = 0 [L264] return 25; VAL [a=1, a12=8, a16=4, a17=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, 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] [L238] COND TRUE ((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1))))))))) [L239] a20 = 0 [L240] a21 = 1 [L241] a17 = 0 [L242] a8 = 14 [L243] a16 = 4 [L244] return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L391] COND TRUE ((((((!(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=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L392] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 372.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 932.8 MB in the beginning and 1.1 GB in the end (delta: -145.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.72 ms. Allocated memory is still 1.1 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 38.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1160.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 853.3 MB in the end (delta: 213.7 MB). Peak memory consumption was 213.7 MB. Max. memory is 11.5 GB. * CodeCheck took 406621.41 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 104.3 MB). Free memory was 853.3 MB in the beginning and 508.0 MB in the end (delta: 345.4 MB). Peak memory consumption was 449.7 MB. Max. memory is 11.5 GB. * Witness Printer took 134.60 ms. Allocated memory is still 1.2 GB. Free memory was 508.0 MB in the beginning and 835.1 MB in the end (delta: -327.2 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...