./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label37.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_44563543-6059-4414-b8ca-7e52f2014414/bin/ukojak/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_44563543-6059-4414-b8ca-7e52f2014414/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_44563543-6059-4414-b8ca-7e52f2014414/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_44563543-6059-4414-b8ca-7e52f2014414/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label37.c -s /tmp/vcloud-vcloud-master/worker/run_dir_44563543-6059-4414-b8ca-7e52f2014414/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_44563543-6059-4414-b8ca-7e52f2014414/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d0e50b67520f5ef6463b4847539751f278a5e38 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.0-69874e2 [2020-12-01 16:50:51,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 16:50:51,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 16:50:51,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 16:50:51,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 16:50:51,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 16:50:51,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 16:50:51,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 16:50:51,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 16:50:51,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 16:50:51,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 16:50:51,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 16:50:51,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 16:50:51,964 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 16:50:51,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 16:50:51,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 16:50:51,989 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 16:50:51,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 16:50:52,006 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 16:50:52,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 16:50:52,018 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 16:50:52,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 16:50:52,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 16:50:52,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 16:50:52,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 16:50:52,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 16:50:52,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 16:50:52,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 16:50:52,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 16:50:52,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 16:50:52,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 16:50:52,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 16:50:52,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 16:50:52,051 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 16:50:52,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 16:50:52,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 16:50:52,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 16:50:52,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 16:50:52,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 16:50:52,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 16:50:52,058 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 16:50:52,062 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_44563543-6059-4414-b8ca-7e52f2014414/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2020-12-01 16:50:52,118 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 16:50:52,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 16:50:52,120 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-01 16:50:52,121 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2020-12-01 16:50:52,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 16:50:52,122 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 16:50:52,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 16:50:52,123 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 16:50:52,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 16:50:52,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 16:50:52,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 16:50:52,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 16:50:52,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 16:50:52,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 16:50:52,126 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 16:50:52,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 16:50:52,127 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 16:50:52,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 16:50:52,128 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2020-12-01 16:50:52,128 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2020-12-01 16:50:52,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 16:50:52,129 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 16:50:52,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-12-01 16:50:52,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 16:50:52,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 16:50:52,130 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 16:50:52,130 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2020-12-01 16:50:52,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 16:50:52,131 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 16:50:52,131 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_44563543-6059-4414-b8ca-7e52f2014414/bin/ukojak/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_44563543-6059-4414-b8ca-7e52f2014414/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(reach_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 -> 4d0e50b67520f5ef6463b4847539751f278a5e38 [2020-12-01 16:50:52,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 16:50:52,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 16:50:52,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 16:50:52,503 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 16:50:52,505 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 16:50:52,506 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_44563543-6059-4414-b8ca-7e52f2014414/bin/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label37.c [2020-12-01 16:50:52,601 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_44563543-6059-4414-b8ca-7e52f2014414/bin/ukojak/data/7e0e484b2/c9fe043d2d2a43f194ab35e08d5eac8a/FLAG170c3dfcc [2020-12-01 16:50:53,357 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 16:50:53,358 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_44563543-6059-4414-b8ca-7e52f2014414/sv-benchmarks/c/eca-rers2012/Problem01_label37.c [2020-12-01 16:50:53,392 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_44563543-6059-4414-b8ca-7e52f2014414/bin/ukojak/data/7e0e484b2/c9fe043d2d2a43f194ab35e08d5eac8a/FLAG170c3dfcc [2020-12-01 16:50:53,527 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_44563543-6059-4414-b8ca-7e52f2014414/bin/ukojak/data/7e0e484b2/c9fe043d2d2a43f194ab35e08d5eac8a [2020-12-01 16:50:53,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 16:50:53,533 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 16:50:53,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 16:50:53,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 16:50:53,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 16:50:53,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:50:53" (1/1) ... [2020-12-01 16:50:53,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@639b87e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:50:53, skipping insertion in model container [2020-12-01 16:50:53,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:50:53" (1/1) ... [2020-12-01 16:50:53,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 16:50:53,613 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 16:50:54,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 16:50:54,234 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 16:50:54,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 16:50:54,433 INFO L208 MainTranslator]: Completed translation [2020-12-01 16:50:54,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:50:54 WrapperNode [2020-12-01 16:50:54,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 16:50:54,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 16:50:54,439 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 16:50:54,439 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 16:50:54,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:50:54" (1/1) ... [2020-12-01 16:50:54,491 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:50:54" (1/1) ... [2020-12-01 16:50:54,568 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 16:50:54,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 16:50:54,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 16:50:54,570 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 16:50:54,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:50:54" (1/1) ... [2020-12-01 16:50:54,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:50:54" (1/1) ... [2020-12-01 16:50:54,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:50:54" (1/1) ... [2020-12-01 16:50:54,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:50:54" (1/1) ... [2020-12-01 16:50:54,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:50:54" (1/1) ... [2020-12-01 16:50:54,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:50:54" (1/1) ... [2020-12-01 16:50:54,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:50:54" (1/1) ... [2020-12-01 16:50:54,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 16:50:54,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 16:50:54,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 16:50:54,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 16:50:54,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:50:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44563543-6059-4414-b8ca-7e52f2014414/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 [2020-12-01 16:50:54,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 16:50:54,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 16:50:54,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 16:50:54,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 16:50:57,658 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 16:50:57,658 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-12-01 16:50:57,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:50:57 BoogieIcfgContainer [2020-12-01 16:50:57,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 16:50:57,663 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2020-12-01 16:50:57,665 INFO L271 PluginConnector]: Initializing CodeCheck... [2020-12-01 16:50:57,677 INFO L275 PluginConnector]: CodeCheck initialized [2020-12-01 16:50:57,678 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:50:57" (1/1) ... [2020-12-01 16:50:57,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:50:57,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:50:57,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2020-12-01 16:50:57,761 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2020-12-01 16:50:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-12-01 16:50:57,768 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:50:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:50:58,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:50:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:50:59,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 145 states and 219 transitions. [2020-12-01 16:50:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2020-12-01 16:50:59,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-01 16:50:59,380 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:50:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:50:59,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 16:51:00,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:00,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 146 states and 220 transitions. [2020-12-01 16:51:00,009 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2020-12-01 16:51:00,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-01 16:51:00,017 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:00,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:51:00,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:00,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 151 states and 228 transitions. [2020-12-01 16:51:00,216 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 228 transitions. [2020-12-01 16:51:00,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-01 16:51:00,224 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:51:01,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:01,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 221 states and 312 transitions. [2020-12-01 16:51:01,238 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 312 transitions. [2020-12-01 16:51:01,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-01 16:51:01,239 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:51:01,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:01,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 231 states and 325 transitions. [2020-12-01 16:51:01,657 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 325 transitions. [2020-12-01 16:51:01,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-01 16:51:01,658 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:01,829 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:51:02,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:02,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 245 states and 347 transitions. [2020-12-01 16:51:02,702 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 347 transitions. [2020-12-01 16:51:02,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-01 16:51:02,706 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:02,817 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:51:03,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 250 states and 352 transitions. [2020-12-01 16:51:03,016 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 352 transitions. [2020-12-01 16:51:03,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-01 16:51:03,018 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:03,155 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:51:03,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:03,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 261 states and 365 transitions. [2020-12-01 16:51:03,606 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 365 transitions. [2020-12-01 16:51:03,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-01 16:51:03,607 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:03,644 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-01 16:51:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 265 states and 369 transitions. [2020-12-01 16:51:03,872 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 369 transitions. [2020-12-01 16:51:03,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-01 16:51:03,874 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:03,920 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-01 16:51:03,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:03,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 267 states and 371 transitions. [2020-12-01 16:51:03,996 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 371 transitions. [2020-12-01 16:51:03,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-01 16:51:03,998 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:04,157 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:51:04,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:04,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 286 states and 393 transitions. [2020-12-01 16:51:04,858 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 393 transitions. [2020-12-01 16:51:04,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-01 16:51:04,860 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-01 16:51:05,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 297 states and 406 transitions. [2020-12-01 16:51:05,555 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 406 transitions. [2020-12-01 16:51:05,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-01 16:51:05,557 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:05,715 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-01 16:51:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 310 states and 423 transitions. [2020-12-01 16:51:06,993 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 423 transitions. [2020-12-01 16:51:06,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-01 16:51:06,996 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:07,182 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:51:08,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 325 states and 446 transitions. [2020-12-01 16:51:08,666 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 446 transitions. [2020-12-01 16:51:08,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-01 16:51:08,668 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:51:09,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 330 states and 451 transitions. [2020-12-01 16:51:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 451 transitions. [2020-12-01 16:51:09,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-01 16:51:09,201 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:09,277 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:51:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:09,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 347 states and 471 transitions. [2020-12-01 16:51:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 471 transitions. [2020-12-01 16:51:09,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-01 16:51:09,852 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-01 16:51:10,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:10,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 349 states and 474 transitions. [2020-12-01 16:51:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 474 transitions. [2020-12-01 16:51:10,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-01 16:51:10,363 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 16:51:10,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:10,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 351 states and 476 transitions. [2020-12-01 16:51:10,739 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 476 transitions. [2020-12-01 16:51:10,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-12-01 16:51:10,741 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:10,887 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:51:12,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:12,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 381 states and 510 transitions. [2020-12-01 16:51:12,171 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 510 transitions. [2020-12-01 16:51:12,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-01 16:51:12,173 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:12,264 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-01 16:51:12,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 395 states and 524 transitions. [2020-12-01 16:51:12,859 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 524 transitions. [2020-12-01 16:51:12,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-12-01 16:51:12,865 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:13,008 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-12-01 16:51:14,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:14,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 410 states and 542 transitions. [2020-12-01 16:51:14,223 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 542 transitions. [2020-12-01 16:51:14,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-01 16:51:14,226 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-01 16:51:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:14,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 424 states and 557 transitions. [2020-12-01 16:51:14,776 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 557 transitions. [2020-12-01 16:51:14,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-12-01 16:51:14,779 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:14,870 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-12-01 16:51:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:14,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 427 states and 561 transitions. [2020-12-01 16:51:14,980 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 561 transitions. [2020-12-01 16:51:14,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-12-01 16:51:14,983 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:15,058 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-01 16:51:15,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 441 states and 577 transitions. [2020-12-01 16:51:15,380 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 577 transitions. [2020-12-01 16:51:15,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-12-01 16:51:15,383 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:15,556 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-01 16:51:16,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:16,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 481 states and 622 transitions. [2020-12-01 16:51:16,913 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 622 transitions. [2020-12-01 16:51:16,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-12-01 16:51:16,916 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-01 16:51:17,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 503 states and 645 transitions. [2020-12-01 16:51:17,638 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 645 transitions. [2020-12-01 16:51:17,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-12-01 16:51:17,645 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-01 16:51:18,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:18,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 511 states and 656 transitions. [2020-12-01 16:51:18,541 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 656 transitions. [2020-12-01 16:51:18,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-12-01 16:51:18,544 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:18,734 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-01 16:51:21,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:21,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 559 states and 711 transitions. [2020-12-01 16:51:21,390 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 711 transitions. [2020-12-01 16:51:21,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-12-01 16:51:21,393 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-01 16:51:21,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:21,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 562 states and 714 transitions. [2020-12-01 16:51:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 714 transitions. [2020-12-01 16:51:21,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-12-01 16:51:21,822 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:21,900 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-01 16:51:22,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:22,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 580 states and 734 transitions. [2020-12-01 16:51:22,608 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 734 transitions. [2020-12-01 16:51:22,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-12-01 16:51:22,611 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-12-01 16:51:23,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:23,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 604 states and 760 transitions. [2020-12-01 16:51:23,581 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 760 transitions. [2020-12-01 16:51:23,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-12-01 16:51:23,583 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-12-01 16:51:24,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:24,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 606 states and 761 transitions. [2020-12-01 16:51:24,090 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 761 transitions. [2020-12-01 16:51:24,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-12-01 16:51:24,092 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:24,173 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-12-01 16:51:25,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:25,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 621 states and 779 transitions. [2020-12-01 16:51:25,032 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 779 transitions. [2020-12-01 16:51:25,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-01 16:51:25,034 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:25,146 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:51:26,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:26,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 653 states and 814 transitions. [2020-12-01 16:51:26,062 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 814 transitions. [2020-12-01 16:51:26,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-01 16:51:26,065 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:26,255 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-12-01 16:51:28,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 700 states and 878 transitions. [2020-12-01 16:51:28,347 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 878 transitions. [2020-12-01 16:51:28,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-01 16:51:28,350 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:28,697 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:51:30,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:30,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 840 states and 1028 transitions. [2020-12-01 16:51:30,975 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1028 transitions. [2020-12-01 16:51:30,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-01 16:51:30,978 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:31,166 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 90 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 16:51:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:31,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 851 states and 1042 transitions. [2020-12-01 16:51:31,640 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1042 transitions. [2020-12-01 16:51:31,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-12-01 16:51:31,643 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2020-12-01 16:51:31,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:31,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 852 states and 1042 transitions. [2020-12-01 16:51:31,974 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1042 transitions. [2020-12-01 16:51:31,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-01 16:51:31,977 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:32,051 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-12-01 16:51:32,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:32,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 873 states and 1064 transitions. [2020-12-01 16:51:32,764 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1064 transitions. [2020-12-01 16:51:32,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-12-01 16:51:32,772 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:33,217 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:51:35,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 944 states and 1135 transitions. [2020-12-01 16:51:35,118 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1135 transitions. [2020-12-01 16:51:35,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-12-01 16:51:35,121 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:35,204 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-01 16:51:36,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:36,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 963 states and 1157 transitions. [2020-12-01 16:51:36,121 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1157 transitions. [2020-12-01 16:51:36,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-01 16:51:36,123 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:36,254 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-01 16:51:37,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:37,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 988 states and 1184 transitions. [2020-12-01 16:51:37,212 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1184 transitions. [2020-12-01 16:51:37,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2020-12-01 16:51:37,215 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:37,424 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-01 16:51:38,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:38,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 998 states and 1197 transitions. [2020-12-01 16:51:38,608 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1197 transitions. [2020-12-01 16:51:38,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2020-12-01 16:51:38,609 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:38,703 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-01 16:51:39,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:39,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1006 states and 1206 transitions. [2020-12-01 16:51:39,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1206 transitions. [2020-12-01 16:51:39,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2020-12-01 16:51:39,066 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:39,156 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-01 16:51:39,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:39,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1031 states and 1232 transitions. [2020-12-01 16:51:39,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1232 transitions. [2020-12-01 16:51:39,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2020-12-01 16:51:39,738 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:39,862 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-01 16:51:40,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:40,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1045 states and 1247 transitions. [2020-12-01 16:51:40,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1247 transitions. [2020-12-01 16:51:40,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-12-01 16:51:40,929 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:41,031 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 145 proven. 41 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-01 16:51:41,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:41,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1054 states and 1256 transitions. [2020-12-01 16:51:41,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1256 transitions. [2020-12-01 16:51:41,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-12-01 16:51:41,777 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:42,367 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-12-01 16:51:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:46,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1098 states and 1316 transitions. [2020-12-01 16:51:46,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1316 transitions. [2020-12-01 16:51:46,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-12-01 16:51:46,509 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:46,626 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-12-01 16:51:48,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:48,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1116 states and 1338 transitions. [2020-12-01 16:51:48,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1338 transitions. [2020-12-01 16:51:48,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-12-01 16:51:48,264 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:48,417 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-12-01 16:51:49,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:49,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1130 states and 1353 transitions. [2020-12-01 16:51:49,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1353 transitions. [2020-12-01 16:51:49,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-12-01 16:51:49,141 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:49,231 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2020-12-01 16:51:49,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:49,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1133 states and 1357 transitions. [2020-12-01 16:51:49,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1357 transitions. [2020-12-01 16:51:49,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-12-01 16:51:49,649 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-01 16:51:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:50,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1147 states and 1372 transitions. [2020-12-01 16:51:50,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1372 transitions. [2020-12-01 16:51:50,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-12-01 16:51:50,999 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:51,156 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-01 16:51:51,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:51,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1157 states and 1381 transitions. [2020-12-01 16:51:51,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1381 transitions. [2020-12-01 16:51:51,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2020-12-01 16:51:51,580 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:51,701 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-12-01 16:51:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:53,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1177 states and 1405 transitions. [2020-12-01 16:51:53,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1405 transitions. [2020-12-01 16:51:53,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2020-12-01 16:51:53,425 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:53,577 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-12-01 16:51:54,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:54,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1181 states and 1407 transitions. [2020-12-01 16:51:54,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1407 transitions. [2020-12-01 16:51:54,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2020-12-01 16:51:54,398 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:54,546 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-12-01 16:51:55,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:55,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1183 states and 1408 transitions. [2020-12-01 16:51:55,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1408 transitions. [2020-12-01 16:51:55,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2020-12-01 16:51:55,041 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:55,192 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-12-01 16:51:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:55,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1185 states and 1409 transitions. [2020-12-01 16:51:55,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1409 transitions. [2020-12-01 16:51:55,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-12-01 16:51:55,527 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:55,626 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-12-01 16:51:57,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:57,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1212 states and 1439 transitions. [2020-12-01 16:51:57,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1439 transitions. [2020-12-01 16:51:57,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-12-01 16:51:57,708 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-12-01 16:51:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:51:59,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1228 states and 1455 transitions. [2020-12-01 16:51:59,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1455 transitions. [2020-12-01 16:51:59,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-12-01 16:51:59,349 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:51:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:51:59,538 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-01 16:52:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:52:00,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1252 states and 1481 transitions. [2020-12-01 16:52:00,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1481 transitions. [2020-12-01 16:52:00,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-12-01 16:52:00,606 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:52:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:52:00,756 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-01 16:52:01,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:52:01,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1272 states and 1500 transitions. [2020-12-01 16:52:01,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1500 transitions. [2020-12-01 16:52:01,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2020-12-01 16:52:01,141 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:52:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:52:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2020-12-01 16:52:02,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:52:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1342 states and 1578 transitions. [2020-12-01 16:52:02,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1578 transitions. [2020-12-01 16:52:02,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2020-12-01 16:52:02,635 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:52:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:52:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 130 proven. 13 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-12-01 16:52:04,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:52:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1344 states and 1582 transitions. [2020-12-01 16:52:04,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1582 transitions. [2020-12-01 16:52:04,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2020-12-01 16:52:04,018 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:52:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:52:04,980 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 202 proven. 46 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-12-01 16:52:11,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:52:11,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1437 states and 1687 transitions. [2020-12-01 16:52:11,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1687 transitions. [2020-12-01 16:52:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2020-12-01 16:52:11,578 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:52:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:52:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 202 proven. 46 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-12-01 16:52:12,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:52:12,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1439 states and 1691 transitions. [2020-12-01 16:52:12,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1691 transitions. [2020-12-01 16:52:12,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2020-12-01 16:52:12,304 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:52:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:52:12,500 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 202 proven. 46 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-12-01 16:52:14,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:52:14,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1454 states and 1711 transitions. [2020-12-01 16:52:14,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1711 transitions. [2020-12-01 16:52:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2020-12-01 16:52:14,587 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:52:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:52:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 199 proven. 73 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-01 16:52:19,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:52:19,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1502 states and 1775 transitions. [2020-12-01 16:52:19,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1775 transitions. [2020-12-01 16:52:19,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2020-12-01 16:52:19,719 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:52:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:52:19,906 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 199 proven. 73 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-01 16:52:21,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:52:21,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1516 states and 1791 transitions. [2020-12-01 16:52:21,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1791 transitions. [2020-12-01 16:52:21,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-12-01 16:52:21,521 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:52:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:52:22,006 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2020-12-01 16:52:24,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:52:24,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1531 states and 1808 transitions. [2020-12-01 16:52:24,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1808 transitions. [2020-12-01 16:52:24,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-12-01 16:52:24,029 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:52:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:52:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-12-01 16:52:24,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:52:24,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1536 states and 1814 transitions. [2020-12-01 16:52:24,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 1814 transitions. [2020-12-01 16:52:24,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2020-12-01 16:52:24,826 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:52:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:52:24,946 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2020-12-01 16:52:25,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:52:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1549 states and 1826 transitions. [2020-12-01 16:52:25,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 1826 transitions. [2020-12-01 16:52:25,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2020-12-01 16:52:25,818 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:52:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:52:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-12-01 16:52:27,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:52:27,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1574 states and 1854 transitions. [2020-12-01 16:52:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 1854 transitions. [2020-12-01 16:52:27,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2020-12-01 16:52:27,152 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:52:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:52:27,267 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-12-01 16:52:28,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:52:28,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1581 states and 1863 transitions. [2020-12-01 16:52:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 1863 transitions. [2020-12-01 16:52:28,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-12-01 16:52:28,704 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:52:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:52:30,160 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 316 proven. 27 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-12-01 16:52:36,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:52:36,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1604 states and 1895 transitions. [2020-12-01 16:52:36,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 1895 transitions. [2020-12-01 16:52:36,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-12-01 16:52:36,135 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:52:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:52:36,363 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 316 proven. 27 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-12-01 16:52:36,701 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2020-12-01 16:52:41,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:52:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1638 states and 1934 transitions. [2020-12-01 16:52:41,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 1934 transitions. [2020-12-01 16:52:41,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-12-01 16:52:41,807 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:52:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:52:42,026 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 316 proven. 27 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-12-01 16:52:44,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:52:44,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1667 states and 1965 transitions. [2020-12-01 16:52:44,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 1965 transitions. [2020-12-01 16:52:44,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-12-01 16:52:44,542 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:52:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:52:44,755 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 316 proven. 27 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-12-01 16:52:45,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:52:45,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1669 states and 1966 transitions. [2020-12-01 16:52:45,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 1966 transitions. [2020-12-01 16:52:45,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-12-01 16:52:45,651 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:52:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:52:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 213 proven. 87 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-12-01 16:52:48,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:52:48,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1683 states and 1981 transitions. [2020-12-01 16:52:48,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 1981 transitions. [2020-12-01 16:52:48,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-12-01 16:52:48,111 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:52:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:52:48,301 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 213 proven. 87 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-12-01 16:52:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:52:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1684 states and 1981 transitions. [2020-12-01 16:52:49,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 1981 transitions. [2020-12-01 16:52:49,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-12-01 16:52:49,141 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:52:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:52:49,261 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2020-12-01 16:52:51,998 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-12-01 16:52:58,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:52:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 1721 states and 2036 transitions. [2020-12-01 16:52:58,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2036 transitions. [2020-12-01 16:52:58,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-12-01 16:52:58,436 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:52:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:52:58,567 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2020-12-01 16:53:03,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:53:03,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 1741 states and 2061 transitions. [2020-12-01 16:53:03,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2061 transitions. [2020-12-01 16:53:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-12-01 16:53:03,020 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:53:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:53:03,126 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2020-12-01 16:53:07,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:53:07,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 1772 states and 2094 transitions. [2020-12-01 16:53:07,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2094 transitions. [2020-12-01 16:53:07,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-12-01 16:53:07,347 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:53:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:53:07,587 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2020-12-01 16:53:09,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:53:09,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 1786 states and 2109 transitions. [2020-12-01 16:53:09,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2109 transitions. [2020-12-01 16:53:09,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-12-01 16:53:09,555 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:53:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:53:09,665 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2020-12-01 16:53:12,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:53:12,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 1802 states and 2126 transitions. [2020-12-01 16:53:12,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2126 transitions. [2020-12-01 16:53:12,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-12-01 16:53:12,238 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:53:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:53:12,366 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2020-12-01 16:53:13,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:53:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 1816 states and 2139 transitions. [2020-12-01 16:53:13,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2139 transitions. [2020-12-01 16:53:14,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-12-01 16:53:14,024 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:53:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:53:14,204 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2020-12-01 16:53:16,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:53:16,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 1830 states and 2155 transitions. [2020-12-01 16:53:16,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2155 transitions. [2020-12-01 16:53:16,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-12-01 16:53:16,535 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:53:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:53:17,983 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 248 proven. 27 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2020-12-01 16:53:24,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:53:24,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 1860 states and 2191 transitions. [2020-12-01 16:53:24,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 2191 transitions. [2020-12-01 16:53:24,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-12-01 16:53:24,086 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:53:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:53:24,247 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 248 proven. 27 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2020-12-01 16:53:25,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:53:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 1862 states and 2195 transitions. [2020-12-01 16:53:25,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2195 transitions. [2020-12-01 16:53:25,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2020-12-01 16:53:25,351 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:53:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:53:26,538 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 267 proven. 103 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-01 16:53:32,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:53:32,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 1899 states and 2238 transitions. [2020-12-01 16:53:32,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2238 transitions. [2020-12-01 16:53:32,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2020-12-01 16:53:32,042 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:53:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:53:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 256 proven. 142 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-01 16:53:34,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:53:34,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 1935 states and 2277 transitions. [2020-12-01 16:53:34,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2277 transitions. [2020-12-01 16:53:34,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2020-12-01 16:53:34,602 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:53:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:53:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2020-12-01 16:53:39,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:53:39,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 1958 states and 2309 transitions. [2020-12-01 16:53:39,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 2309 transitions. [2020-12-01 16:53:39,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2020-12-01 16:53:39,765 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:53:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:53:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 236 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:53:51,075 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2020-12-01 16:53:53,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:53:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 2039 states and 2399 transitions. [2020-12-01 16:53:53,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2399 transitions. [2020-12-01 16:53:53,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2020-12-01 16:53:53,299 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:53:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:53:53,669 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 236 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:53:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:53:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2425 states to 2064 states and 2425 transitions. [2020-12-01 16:53:57,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2425 transitions. [2020-12-01 16:53:57,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-12-01 16:53:57,645 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:53:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:53:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-12-01 16:54:01,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:54:01,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2094 states and 2461 transitions. [2020-12-01 16:54:01,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 2461 transitions. [2020-12-01 16:54:01,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-12-01 16:54:01,657 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:54:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:54:01,782 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-12-01 16:54:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:54:02,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2095 states and 2461 transitions. [2020-12-01 16:54:02,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 2461 transitions. [2020-12-01 16:54:02,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2020-12-01 16:54:02,875 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:54:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:54:03,632 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 242 proven. 46 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-12-01 16:54:13,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:54:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2131 states and 2507 transitions. [2020-12-01 16:54:13,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2507 transitions. [2020-12-01 16:54:13,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2020-12-01 16:54:13,776 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:54:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:54:14,065 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 242 proven. 46 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-12-01 16:54:17,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:54:17,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2145 states and 2523 transitions. [2020-12-01 16:54:17,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 2523 transitions. [2020-12-01 16:54:17,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2020-12-01 16:54:17,984 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:54:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:54:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 354 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-12-01 16:54:19,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:54:19,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2153 states and 2530 transitions. [2020-12-01 16:54:19,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2153 states and 2530 transitions. [2020-12-01 16:54:19,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2020-12-01 16:54:19,133 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:54:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:54:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 188 proven. 131 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2020-12-01 16:54:28,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:54:28,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2270 states and 2660 transitions. [2020-12-01 16:54:28,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 2660 transitions. [2020-12-01 16:54:28,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2020-12-01 16:54:28,195 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:54:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:54:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2020-12-01 16:54:30,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:54:30,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2679 states to 2289 states and 2679 transitions. [2020-12-01 16:54:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2289 states and 2679 transitions. [2020-12-01 16:54:30,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2020-12-01 16:54:30,747 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:54:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:54:30,945 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2020-12-01 16:54:32,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:54:32,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2301 states and 2690 transitions. [2020-12-01 16:54:32,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 2690 transitions. [2020-12-01 16:54:32,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2020-12-01 16:54:32,335 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:54:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:54:34,503 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 313 proven. 64 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-12-01 16:54:48,318 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2020-12-01 16:54:49,334 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2020-12-01 16:54:50,491 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2020-12-01 16:54:51,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:54:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2396 states and 2802 transitions. [2020-12-01 16:54:51,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 2802 transitions. [2020-12-01 16:54:51,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2020-12-01 16:54:51,312 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:54:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:54:51,587 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 313 proven. 64 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-12-01 16:54:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:54:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2409 states and 2813 transitions. [2020-12-01 16:54:54,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2409 states and 2813 transitions. [2020-12-01 16:54:54,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2020-12-01 16:54:54,114 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:54:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 16:54:54,171 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 16:54:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 16:54:54,324 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 16:54:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 16:54:54,618 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 16:54:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 16:54:54,737 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 16:55:03,442 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 104 iterations. [2020-12-01 16:55:03,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 04:55:03 ImpRootNode [2020-12-01 16:55:03,845 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2020-12-01 16:55:03,846 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 16:55:03,846 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 16:55:03,846 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 16:55:03,847 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:50:57" (3/4) ... [2020-12-01 16:55:03,850 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 16:55:04,146 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_44563543-6059-4414-b8ca-7e52f2014414/bin/ukojak/witness.graphml [2020-12-01 16:55:04,146 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 16:55:04,148 INFO L168 Benchmark]: Toolchain (without parser) took 250614.85 ms. Allocated memory was 98.6 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 68.1 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 349.3 MB. Max. memory is 16.1 GB. [2020-12-01 16:55:04,148 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 98.6 MB. Free memory was 58.4 MB in the beginning and 58.4 MB in the end (delta: 71.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 16:55:04,149 INFO L168 Benchmark]: CACSL2BoogieTranslator took 901.95 ms. Allocated memory is still 98.6 MB. Free memory was 68.1 MB in the beginning and 58.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-01 16:55:04,149 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.65 ms. Allocated memory is still 98.6 MB. Free memory was 58.4 MB in the beginning and 53.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-01 16:55:04,150 INFO L168 Benchmark]: Boogie Preprocessor took 134.63 ms. Allocated memory is still 98.6 MB. Free memory was 53.0 MB in the beginning and 48.3 MB in the end (delta: 4.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-01 16:55:04,150 INFO L168 Benchmark]: RCFGBuilder took 2957.09 ms. Allocated memory was 98.6 MB in the beginning and 119.5 MB in the end (delta: 21.0 MB). Free memory was 48.3 MB in the beginning and 53.4 MB in the end (delta: -5.1 MB). Peak memory consumption was 40.9 MB. Max. memory is 16.1 GB. [2020-12-01 16:55:04,151 INFO L168 Benchmark]: CodeCheck took 246181.62 ms. Allocated memory was 119.5 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 53.4 MB in the beginning and 2.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 271.7 MB. Max. memory is 16.1 GB. [2020-12-01 16:55:04,152 INFO L168 Benchmark]: Witness Printer took 300.84 ms. Allocated memory is still 2.4 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.1 GB. [2020-12-01 16:55:04,154 INFO L339 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. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 245.7s, OverallIterations: 104, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 33958072 SDtfs, 2137813582 SDslu, -2044365716 SDs, 0 SdLazy, -1715468934 SolverSat, -622729068 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 736.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 122977 GetRequests, 118510 SyntacticMatches, 3415 SemanticMatches, 1052 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706755 ImplicationChecksByTransitivity, 193.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.9s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 18.0s InterpolantComputationTime, 18550 NumberOfCodeBlocks, 18550 NumberOfCodeBlocksAsserted, 104 NumberOfCheckSat, 18182 ConstructedInterpolants, 0 QuantifiedInterpolants, 13751899 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 103 InterpolantComputations, 77 PerfectInterpolantSequences, 20189/21736 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: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] 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] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] 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] [L45] 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] [L53] 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] [L59] 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] [L64] 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] [L72] 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] [L75] 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] [L82] 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] [L90] 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] [L94] 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] [L102] 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] [L107] 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] [L112] 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] [L118] 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] [L124] 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] [L129] 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] [L134] 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] [L139] 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] [L146] 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] [L150] 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] [L154] 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] [L158] 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] [L162] 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] [L170] 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] [L175] 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] [L183] 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] [L188] 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] [L196] 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] [L199] 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] [L204] 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] [L207] 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] [L213] 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] [L218] 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] [L224] 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] [L228] 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] [L233] 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] [L241] 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] [L248] 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] [L255] 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] [L260] 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] [L266] 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] [L271] 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] [L275] 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] [L278] 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] [L283] 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] [L288] 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] [L296] 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] [L302] 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] [L309] 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] [L316] 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] [L322] 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] [L326] 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] [L328] 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] [L334] 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] [L339] 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] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] 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] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] 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] [L45] 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] [L53] 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] [L59] 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] [L64] 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] [L72] 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] [L75] 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] [L82] 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] [L90] 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] [L94] 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] [L102] 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] [L107] 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] [L112] 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] [L118] 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] [L124] 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] [L129] 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] [L134] 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] [L139] 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] [L146] 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] [L150] 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] [L154] 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] [L158] 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] [L162] 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] [L170] 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] [L175] 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] [L183] 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] [L188] 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] [L196] 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] [L199] 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] [L204] 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] [L207] 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] [L213] 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] [L218] 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] [L224] 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] [L228] 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] [L233] 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] [L241] 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] [L248] 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] [L255] 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] [L260] 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] [L266] 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] [L271] 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] [L275] 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] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] 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] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] 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] [L45] 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] [L53] 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] [L59] 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] [L64] 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] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] 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] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] 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] [L45] 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] [L53] 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] [L59] 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] [L64] 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] [L72] 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] [L75] 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] [L82] 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)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] 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] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] 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] [L45] 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] [L53] 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] [L59] 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] [L64] 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] [L72] 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] [L75] 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] [L82] 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] [L90] 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] [L94] 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] [L102] 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] [L107] 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] [L112] 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] [L118] 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] [L124] 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] [L129] 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] [L134] 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] [L139] 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] [L146] 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] [L150] 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] [L154] 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] [L158] 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] [L162] 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] [L170] 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] [L175] 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] [L183] 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] [L188] 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] [L196] 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] [L199] 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] [L204] 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] [L207] 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] [L213] 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] [L218] 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] [L224] 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] [L228] 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] [L233] 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] [L241] 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] [L248] 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] [L255] 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] [L260] 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] [L266] 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] [L271] 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=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] [L275] 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=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] [L278] 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=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] [L283] 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=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] [L288] 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=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] [L296] 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=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] [L302] 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=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] [L309] 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=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] [L316] 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=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] [L322] 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=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] [L326] 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=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] [L328] 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=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] [L334] 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=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] [L339] 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=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] [L343] 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=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] [L347] 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=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] [L355] 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=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] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(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] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(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] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(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] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(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] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(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] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==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] [L387] COND TRUE ((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5)) [L388] a21 = 1 [L389] a16 = 6 [L390] a7 = 0 [L391] return -1; VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L41] 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=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] 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=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] 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=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] 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=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] 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=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] 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=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] 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=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L302] 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=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] 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=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L343] 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=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] 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=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((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=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L392] 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)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L410] COND TRUE (((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1)) VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L12] __assert_fail("0", "Problem01_label37.c", 4, "reach_error") VAL [a=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49 ms. Allocated memory is still 98.6 MB. Free memory was 58.4 MB in the beginning and 58.4 MB in the end (delta: 71.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 901.95 ms. Allocated memory is still 98.6 MB. Free memory was 68.1 MB in the beginning and 58.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 130.65 ms. Allocated memory is still 98.6 MB. Free memory was 58.4 MB in the beginning and 53.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 134.63 ms. Allocated memory is still 98.6 MB. Free memory was 53.0 MB in the beginning and 48.3 MB in the end (delta: 4.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2957.09 ms. Allocated memory was 98.6 MB in the beginning and 119.5 MB in the end (delta: 21.0 MB). Free memory was 48.3 MB in the beginning and 53.4 MB in the end (delta: -5.1 MB). Peak memory consumption was 40.9 MB. Max. memory is 16.1 GB. * CodeCheck took 246181.62 ms. Allocated memory was 119.5 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 53.4 MB in the beginning and 2.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 271.7 MB. Max. memory is 16.1 GB. * Witness Printer took 300.84 ms. Allocated memory is still 2.4 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...