./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label56.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_043d65df-3e5a-4032-b97c-e0bc837ff91b/bin/ukojak/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_043d65df-3e5a-4032-b97c-e0bc837ff91b/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_043d65df-3e5a-4032-b97c-e0bc837ff91b/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_043d65df-3e5a-4032-b97c-e0bc837ff91b/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label56.c -s /tmp/vcloud-vcloud-master/worker/run_dir_043d65df-3e5a-4032-b97c-e0bc837ff91b/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_043d65df-3e5a-4032-b97c-e0bc837ff91b/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 583d1bcfa4b20c513c87cc5240a593897b35ff88 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-a4ecdab [2020-11-29 22:35:15,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 22:35:15,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 22:35:15,675 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 22:35:15,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 22:35:15,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 22:35:15,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 22:35:15,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 22:35:15,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 22:35:15,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 22:35:15,696 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 22:35:15,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 22:35:15,701 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 22:35:15,705 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 22:35:15,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 22:35:15,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 22:35:15,712 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 22:35:15,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 22:35:15,720 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 22:35:15,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 22:35:15,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 22:35:15,733 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 22:35:15,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 22:35:15,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 22:35:15,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 22:35:15,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 22:35:15,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 22:35:15,752 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 22:35:15,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 22:35:15,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 22:35:15,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 22:35:15,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 22:35:15,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 22:35:15,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 22:35:15,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 22:35:15,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 22:35:15,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 22:35:15,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 22:35:15,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 22:35:15,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 22:35:15,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 22:35:15,767 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_043d65df-3e5a-4032-b97c-e0bc837ff91b/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2020-11-29 22:35:15,812 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 22:35:15,812 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 22:35:15,814 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-29 22:35:15,814 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2020-11-29 22:35:15,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 22:35:15,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 22:35:15,816 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 22:35:15,817 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 22:35:15,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 22:35:15,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 22:35:15,819 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 22:35:15,819 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 22:35:15,819 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 22:35:15,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 22:35:15,820 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 22:35:15,820 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 22:35:15,820 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 22:35:15,821 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 22:35:15,821 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2020-11-29 22:35:15,821 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2020-11-29 22:35:15,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 22:35:15,822 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 22:35:15,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-11-29 22:35:15,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 22:35:15,823 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 22:35:15,823 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 22:35:15,823 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2020-11-29 22:35:15,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 22:35:15,824 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 22:35:15,826 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_043d65df-3e5a-4032-b97c-e0bc837ff91b/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_043d65df-3e5a-4032-b97c-e0bc837ff91b/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 -> 583d1bcfa4b20c513c87cc5240a593897b35ff88 [2020-11-29 22:35:16,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 22:35:16,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 22:35:16,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 22:35:16,135 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 22:35:16,136 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 22:35:16,137 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_043d65df-3e5a-4032-b97c-e0bc837ff91b/bin/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label56.c [2020-11-29 22:35:16,248 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_043d65df-3e5a-4032-b97c-e0bc837ff91b/bin/ukojak/data/5924c7eb0/5076d80f7f754bc58661e6bcd8dc9d11/FLAG2385d75d8 [2020-11-29 22:35:16,925 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 22:35:16,926 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_043d65df-3e5a-4032-b97c-e0bc837ff91b/sv-benchmarks/c/eca-rers2012/Problem01_label56.c [2020-11-29 22:35:16,941 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_043d65df-3e5a-4032-b97c-e0bc837ff91b/bin/ukojak/data/5924c7eb0/5076d80f7f754bc58661e6bcd8dc9d11/FLAG2385d75d8 [2020-11-29 22:35:17,119 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_043d65df-3e5a-4032-b97c-e0bc837ff91b/bin/ukojak/data/5924c7eb0/5076d80f7f754bc58661e6bcd8dc9d11 [2020-11-29 22:35:17,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 22:35:17,124 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 22:35:17,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 22:35:17,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 22:35:17,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 22:35:17,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 10:35:17" (1/1) ... [2020-11-29 22:35:17,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@731cc912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:35:17, skipping insertion in model container [2020-11-29 22:35:17,136 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 10:35:17" (1/1) ... [2020-11-29 22:35:17,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 22:35:17,190 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 22:35:17,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 22:35:17,602 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 22:35:17,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 22:35:17,785 INFO L208 MainTranslator]: Completed translation [2020-11-29 22:35:17,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:35:17 WrapperNode [2020-11-29 22:35:17,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 22:35:17,788 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 22:35:17,788 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 22:35:17,788 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 22:35:17,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:35:17" (1/1) ... [2020-11-29 22:35:17,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:35:17" (1/1) ... [2020-11-29 22:35:17,873 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 22:35:17,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 22:35:17,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 22:35:17,874 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 22:35:17,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:35:17" (1/1) ... [2020-11-29 22:35:17,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:35:17" (1/1) ... [2020-11-29 22:35:17,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:35:17" (1/1) ... [2020-11-29 22:35:17,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:35:17" (1/1) ... [2020-11-29 22:35:17,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:35:17" (1/1) ... [2020-11-29 22:35:17,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:35:17" (1/1) ... [2020-11-29 22:35:17,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:35:17" (1/1) ... [2020-11-29 22:35:17,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 22:35:17,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 22:35:17,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 22:35:17,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 22:35:17,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:35:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_043d65df-3e5a-4032-b97c-e0bc837ff91b/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-11-29 22:35:18,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 22:35:18,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 22:35:18,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 22:35:18,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 22:35:20,749 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 22:35:20,749 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-11-29 22:35:20,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:35:20 BoogieIcfgContainer [2020-11-29 22:35:20,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 22:35:20,753 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2020-11-29 22:35:20,754 INFO L271 PluginConnector]: Initializing CodeCheck... [2020-11-29 22:35:20,768 INFO L275 PluginConnector]: CodeCheck initialized [2020-11-29 22:35:20,768 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:35:20" (1/1) ... [2020-11-29 22:35:20,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:35:20,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:20,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2020-11-29 22:35:20,852 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2020-11-29 22:35:20,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-29 22:35:20,859 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:21,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:35:22,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:22,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 145 states and 219 transitions. [2020-11-29 22:35:22,153 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2020-11-29 22:35:22,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-11-29 22:35:22,157 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:22,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-29 22:35:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 146 states and 220 transitions. [2020-11-29 22:35:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2020-11-29 22:35:22,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-29 22:35:22,690 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:22,810 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:35:22,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:22,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 151 states and 228 transitions. [2020-11-29 22:35:22,918 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 228 transitions. [2020-11-29 22:35:22,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-29 22:35:22,930 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:23,054 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:35:23,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:23,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 221 states and 300 transitions. [2020-11-29 22:35:23,802 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 300 transitions. [2020-11-29 22:35:23,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-11-29 22:35:23,805 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:23,920 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:35:24,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:24,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 233 states and 315 transitions. [2020-11-29 22:35:24,154 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 315 transitions. [2020-11-29 22:35:24,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-29 22:35:24,156 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:24,291 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-29 22:35:24,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:24,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 249 states and 338 transitions. [2020-11-29 22:35:24,926 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 338 transitions. [2020-11-29 22:35:24,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-29 22:35:24,929 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:24,991 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-29 22:35:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 254 states and 343 transitions. [2020-11-29 22:35:25,181 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 343 transitions. [2020-11-29 22:35:25,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-29 22:35:25,183 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:25,362 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:35:25,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:25,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 267 states and 358 transitions. [2020-11-29 22:35:25,802 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 358 transitions. [2020-11-29 22:35:25,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-29 22:35:25,804 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:25,897 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-29 22:35:26,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:26,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 271 states and 362 transitions. [2020-11-29 22:35:26,121 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 362 transitions. [2020-11-29 22:35:26,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-11-29 22:35:26,126 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-29 22:35:26,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:26,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 282 states and 374 transitions. [2020-11-29 22:35:26,777 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 374 transitions. [2020-11-29 22:35:26,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-11-29 22:35:26,778 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:26,822 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:35:27,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:27,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 299 states and 393 transitions. [2020-11-29 22:35:27,054 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 393 transitions. [2020-11-29 22:35:27,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-11-29 22:35:27,055 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:27,193 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-29 22:35:28,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 314 states and 413 transitions. [2020-11-29 22:35:28,164 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 413 transitions. [2020-11-29 22:35:28,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-11-29 22:35:28,165 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:28,229 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-29 22:35:28,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 316 states and 414 transitions. [2020-11-29 22:35:28,410 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 414 transitions. [2020-11-29 22:35:28,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-11-29 22:35:28,411 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:28,446 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-11-29 22:35:28,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:28,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 317 states and 416 transitions. [2020-11-29 22:35:28,594 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 416 transitions. [2020-11-29 22:35:28,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-11-29 22:35:28,595 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:28,679 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-29 22:35:28,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 320 states and 420 transitions. [2020-11-29 22:35:28,987 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 420 transitions. [2020-11-29 22:35:28,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-11-29 22:35:28,989 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:29,135 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:35:30,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:30,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 350 states and 453 transitions. [2020-11-29 22:35:30,046 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 453 transitions. [2020-11-29 22:35:30,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-11-29 22:35:30,048 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:30,135 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-29 22:35:30,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:30,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 364 states and 467 transitions. [2020-11-29 22:35:30,498 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 467 transitions. [2020-11-29 22:35:30,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-11-29 22:35:30,499 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:30,555 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-29 22:35:30,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:30,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 367 states and 471 transitions. [2020-11-29 22:35:30,638 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 471 transitions. [2020-11-29 22:35:30,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-11-29 22:35:30,640 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:30,719 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-29 22:35:31,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:31,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 381 states and 485 transitions. [2020-11-29 22:35:31,160 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 485 transitions. [2020-11-29 22:35:31,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-11-29 22:35:31,162 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:31,229 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:35:31,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:31,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 404 states and 509 transitions. [2020-11-29 22:35:31,492 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 509 transitions. [2020-11-29 22:35:31,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-11-29 22:35:31,495 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:31,661 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:35:32,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:32,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 444 states and 552 transitions. [2020-11-29 22:35:32,653 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 552 transitions. [2020-11-29 22:35:32,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-11-29 22:35:32,655 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:32,719 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-29 22:35:33,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:33,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 485 states and 597 transitions. [2020-11-29 22:35:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 597 transitions. [2020-11-29 22:35:33,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-11-29 22:35:33,638 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:33,706 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-29 22:35:34,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:34,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 488 states and 602 transitions. [2020-11-29 22:35:34,005 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 602 transitions. [2020-11-29 22:35:34,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-11-29 22:35:34,007 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:34,101 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-29 22:35:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:34,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 493 states and 607 transitions. [2020-11-29 22:35:34,347 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 607 transitions. [2020-11-29 22:35:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-11-29 22:35:34,349 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:34,486 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-29 22:35:34,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:34,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 507 states and 624 transitions. [2020-11-29 22:35:34,793 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 624 transitions. [2020-11-29 22:35:34,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-29 22:35:34,794 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:34,996 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 68 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:35:37,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:37,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 561 states and 697 transitions. [2020-11-29 22:35:37,191 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 697 transitions. [2020-11-29 22:35:37,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-29 22:35:37,193 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:37,283 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 68 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:35:37,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:37,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 566 states and 702 transitions. [2020-11-29 22:35:37,482 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 702 transitions. [2020-11-29 22:35:37,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-11-29 22:35:37,484 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:37,535 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-29 22:35:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:37,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 571 states and 708 transitions. [2020-11-29 22:35:37,667 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 708 transitions. [2020-11-29 22:35:37,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-11-29 22:35:37,669 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-29 22:35:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:37,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 574 states and 711 transitions. [2020-11-29 22:35:37,927 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 711 transitions. [2020-11-29 22:35:37,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-11-29 22:35:37,929 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:37,996 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-29 22:35:38,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:38,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 577 states and 714 transitions. [2020-11-29 22:35:38,359 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 714 transitions. [2020-11-29 22:35:38,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-11-29 22:35:38,361 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:38,439 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-11-29 22:35:39,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:39,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 601 states and 740 transitions. [2020-11-29 22:35:39,143 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 740 transitions. [2020-11-29 22:35:39,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-11-29 22:35:39,144 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-11-29 22:35:39,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:39,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 619 states and 761 transitions. [2020-11-29 22:35:39,654 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 761 transitions. [2020-11-29 22:35:39,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-11-29 22:35:39,656 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-29 22:35:39,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:39,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 622 states and 765 transitions. [2020-11-29 22:35:39,962 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 765 transitions. [2020-11-29 22:35:39,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-11-29 22:35:39,964 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-11-29 22:35:40,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 634 states and 780 transitions. [2020-11-29 22:35:40,426 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 780 transitions. [2020-11-29 22:35:40,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-11-29 22:35:40,428 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:40,497 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:35:41,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:41,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 666 states and 815 transitions. [2020-11-29 22:35:41,037 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 815 transitions. [2020-11-29 22:35:41,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-11-29 22:35:41,039 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:41,399 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:35:42,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:42,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 736 states and 892 transitions. [2020-11-29 22:35:42,417 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 892 transitions. [2020-11-29 22:35:42,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-11-29 22:35:42,419 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-11-29 22:35:42,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:42,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 737 states and 894 transitions. [2020-11-29 22:35:42,925 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 894 transitions. [2020-11-29 22:35:42,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-11-29 22:35:42,929 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:43,137 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:35:45,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:45,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 806 states and 969 transitions. [2020-11-29 22:35:45,006 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 969 transitions. [2020-11-29 22:35:45,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-11-29 22:35:45,008 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:45,068 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:35:45,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:45,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 827 states and 993 transitions. [2020-11-29 22:35:45,271 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 993 transitions. [2020-11-29 22:35:45,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-11-29 22:35:45,273 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:45,371 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2020-11-29 22:35:45,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:45,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 828 states and 993 transitions. [2020-11-29 22:35:45,560 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 993 transitions. [2020-11-29 22:35:45,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-11-29 22:35:45,561 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:45,638 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-29 22:35:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:46,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 856 states and 1023 transitions. [2020-11-29 22:35:46,452 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1023 transitions. [2020-11-29 22:35:46,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-11-29 22:35:46,455 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:46,893 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:35:48,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:48,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 927 states and 1094 transitions. [2020-11-29 22:35:48,192 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1094 transitions. [2020-11-29 22:35:48,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-11-29 22:35:48,194 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:48,278 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:35:48,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:48,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 944 states and 1112 transitions. [2020-11-29 22:35:48,660 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1112 transitions. [2020-11-29 22:35:48,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-11-29 22:35:48,662 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:48,752 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-11-29 22:35:49,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:49,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 983 states and 1154 transitions. [2020-11-29 22:35:49,874 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1154 transitions. [2020-11-29 22:35:49,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2020-11-29 22:35:49,876 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-11-29 22:35:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:50,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1008 states and 1181 transitions. [2020-11-29 22:35:50,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1181 transitions. [2020-11-29 22:35:50,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-11-29 22:35:50,599 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:51,244 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 183 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:35:54,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1092 states and 1275 transitions. [2020-11-29 22:35:54,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1275 transitions. [2020-11-29 22:35:54,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-11-29 22:35:54,148 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-11-29 22:35:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:54,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1094 states and 1276 transitions. [2020-11-29 22:35:54,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1276 transitions. [2020-11-29 22:35:54,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-11-29 22:35:54,693 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:35:56,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:56,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1148 states and 1336 transitions. [2020-11-29 22:35:56,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1336 transitions. [2020-11-29 22:35:56,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-11-29 22:35:56,422 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:56,866 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-11-29 22:35:59,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:35:59,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1192 states and 1393 transitions. [2020-11-29 22:35:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1393 transitions. [2020-11-29 22:35:59,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-11-29 22:35:59,183 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:35:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:35:59,281 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:36:00,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:00,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1212 states and 1419 transitions. [2020-11-29 22:36:00,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1419 transitions. [2020-11-29 22:36:00,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-11-29 22:36:00,488 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:00,601 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:36:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:01,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1223 states and 1431 transitions. [2020-11-29 22:36:01,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1431 transitions. [2020-11-29 22:36:01,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-11-29 22:36:01,363 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-11-29 22:36:01,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:01,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1225 states and 1432 transitions. [2020-11-29 22:36:01,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1432 transitions. [2020-11-29 22:36:01,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-11-29 22:36:01,488 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:01,995 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:36:06,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:06,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1305 states and 1537 transitions. [2020-11-29 22:36:06,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1537 transitions. [2020-11-29 22:36:06,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-11-29 22:36:06,433 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:06,680 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:36:07,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:07,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1308 states and 1541 transitions. [2020-11-29 22:36:07,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1541 transitions. [2020-11-29 22:36:07,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-11-29 22:36:07,713 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:07,908 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-11-29 22:36:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1319 states and 1552 transitions. [2020-11-29 22:36:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1552 transitions. [2020-11-29 22:36:09,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-11-29 22:36:09,045 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:09,238 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:36:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:10,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1334 states and 1572 transitions. [2020-11-29 22:36:10,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1572 transitions. [2020-11-29 22:36:10,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-11-29 22:36:10,154 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:10,311 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:36:10,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:10,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1336 states and 1575 transitions. [2020-11-29 22:36:10,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1575 transitions. [2020-11-29 22:36:10,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-11-29 22:36:10,824 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:10,986 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:36:11,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1350 states and 1591 transitions. [2020-11-29 22:36:11,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1591 transitions. [2020-11-29 22:36:11,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-11-29 22:36:11,761 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:36:12,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:12,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1361 states and 1602 transitions. [2020-11-29 22:36:12,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1602 transitions. [2020-11-29 22:36:12,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-11-29 22:36:12,786 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:12,906 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-11-29 22:36:13,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1363 states and 1605 transitions. [2020-11-29 22:36:13,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1605 transitions. [2020-11-29 22:36:13,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-11-29 22:36:13,368 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:36:13,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:13,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1366 states and 1608 transitions. [2020-11-29 22:36:13,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1608 transitions. [2020-11-29 22:36:13,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-11-29 22:36:13,960 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:14,086 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2020-11-29 22:36:14,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:14,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1381 states and 1620 transitions. [2020-11-29 22:36:14,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1620 transitions. [2020-11-29 22:36:14,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-11-29 22:36:14,976 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:15,680 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 150 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:36:19,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:19,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1420 states and 1664 transitions. [2020-11-29 22:36:19,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1664 transitions. [2020-11-29 22:36:19,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-11-29 22:36:19,150 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:19,326 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2020-11-29 22:36:19,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:19,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1490 states and 1736 transitions. [2020-11-29 22:36:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1736 transitions. [2020-11-29 22:36:19,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2020-11-29 22:36:19,946 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:20,065 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:36:20,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:20,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1492 states and 1738 transitions. [2020-11-29 22:36:20,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1738 transitions. [2020-11-29 22:36:20,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2020-11-29 22:36:20,522 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2020-11-29 22:36:21,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1562 states and 1810 transitions. [2020-11-29 22:36:21,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 1810 transitions. [2020-11-29 22:36:21,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-11-29 22:36:21,636 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:22,034 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 185 proven. 46 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-11-29 22:36:22,357 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2020-11-29 22:36:26,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:26,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1601 states and 1862 transitions. [2020-11-29 22:36:26,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 1862 transitions. [2020-11-29 22:36:26,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-11-29 22:36:26,756 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:26,959 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 185 proven. 46 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-11-29 22:36:29,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1618 states and 1888 transitions. [2020-11-29 22:36:29,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 1888 transitions. [2020-11-29 22:36:29,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-11-29 22:36:29,232 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:29,523 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 185 proven. 46 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-11-29 22:36:30,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:30,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1619 states and 1889 transitions. [2020-11-29 22:36:30,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 1889 transitions. [2020-11-29 22:36:30,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2020-11-29 22:36:30,198 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:30,485 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2020-11-29 22:36:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:34,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1664 states and 1946 transitions. [2020-11-29 22:36:34,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 1946 transitions. [2020-11-29 22:36:34,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2020-11-29 22:36:34,231 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:34,567 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 153 proven. 87 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-11-29 22:36:40,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:40,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 1726 states and 2026 transitions. [2020-11-29 22:36:40,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2026 transitions. [2020-11-29 22:36:40,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2020-11-29 22:36:40,699 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:40,824 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 153 proven. 87 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-11-29 22:36:42,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:42,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 1748 states and 2051 transitions. [2020-11-29 22:36:42,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2051 transitions. [2020-11-29 22:36:42,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2020-11-29 22:36:42,280 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:42,423 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 153 proven. 87 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-11-29 22:36:43,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:43,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 1749 states and 2053 transitions. [2020-11-29 22:36:43,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2053 transitions. [2020-11-29 22:36:43,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2020-11-29 22:36:43,189 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:43,315 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 153 proven. 87 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-11-29 22:36:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:44,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 1750 states and 2055 transitions. [2020-11-29 22:36:44,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2055 transitions. [2020-11-29 22:36:44,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-11-29 22:36:44,418 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-11-29 22:36:47,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:47,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 1768 states and 2076 transitions. [2020-11-29 22:36:47,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2076 transitions. [2020-11-29 22:36:47,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-11-29 22:36:47,981 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:48,060 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-11-29 22:36:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:48,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 1769 states and 2076 transitions. [2020-11-29 22:36:48,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2076 transitions. [2020-11-29 22:36:48,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-11-29 22:36:48,447 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:48,548 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-11-29 22:36:49,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 1772 states and 2080 transitions. [2020-11-29 22:36:49,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2080 transitions. [2020-11-29 22:36:49,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-11-29 22:36:49,142 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:49,216 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-11-29 22:36:49,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:49,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 1774 states and 2083 transitions. [2020-11-29 22:36:49,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2083 transitions. [2020-11-29 22:36:49,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-11-29 22:36:49,866 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2020-11-29 22:36:50,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 1787 states and 2095 transitions. [2020-11-29 22:36:50,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2095 transitions. [2020-11-29 22:36:50,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-11-29 22:36:50,653 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:50,730 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2020-11-29 22:36:51,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:51,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 1800 states and 2107 transitions. [2020-11-29 22:36:51,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2107 transitions. [2020-11-29 22:36:51,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2020-11-29 22:36:51,531 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 287 proven. 26 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-11-29 22:36:59,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:36:59,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 1830 states and 2150 transitions. [2020-11-29 22:36:59,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2150 transitions. [2020-11-29 22:36:59,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2020-11-29 22:36:59,275 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:36:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:36:59,394 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 287 proven. 26 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-11-29 22:37:01,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:37:01,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 1835 states and 2155 transitions. [2020-11-29 22:37:01,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2155 transitions. [2020-11-29 22:37:01,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2020-11-29 22:37:01,822 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:37:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:01,944 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 287 proven. 26 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-11-29 22:37:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:37:06,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 1852 states and 2172 transitions. [2020-11-29 22:37:06,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2172 transitions. [2020-11-29 22:37:06,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-11-29 22:37:06,607 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:37:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:07,102 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-11-29 22:37:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:37:16,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 1903 states and 2238 transitions. [2020-11-29 22:37:16,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 2238 transitions. [2020-11-29 22:37:16,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-11-29 22:37:16,547 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:37:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:16,681 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-11-29 22:37:22,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:37:22,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 1922 states and 2261 transitions. [2020-11-29 22:37:22,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2261 transitions. [2020-11-29 22:37:22,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-11-29 22:37:22,173 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:37:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:22,243 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-11-29 22:37:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:37:23,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 1925 states and 2262 transitions. [2020-11-29 22:37:23,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2262 transitions. [2020-11-29 22:37:23,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-11-29 22:37:23,905 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:37:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:23,996 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-11-29 22:37:25,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:37:25,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 1938 states and 2274 transitions. [2020-11-29 22:37:25,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 2274 transitions. [2020-11-29 22:37:25,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-11-29 22:37:25,806 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:37:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:25,918 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-11-29 22:37:28,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:37:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 1952 states and 2292 transitions. [2020-11-29 22:37:28,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2292 transitions. [2020-11-29 22:37:28,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-11-29 22:37:28,282 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:37:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-11-29 22:37:29,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:37:29,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 1965 states and 2304 transitions. [2020-11-29 22:37:29,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2304 transitions. [2020-11-29 22:37:29,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2020-11-29 22:37:29,598 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:37:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:29,775 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 315 proven. 11 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-11-29 22:37:30,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:37:30,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 1980 states and 2322 transitions. [2020-11-29 22:37:30,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 2322 transitions. [2020-11-29 22:37:30,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-11-29 22:37:30,918 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:37:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:31,096 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-29 22:37:33,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:37:33,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2011 states and 2359 transitions. [2020-11-29 22:37:33,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2359 transitions. [2020-11-29 22:37:33,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-11-29 22:37:33,834 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:37:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-29 22:37:34,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:37:34,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2020 states and 2367 transitions. [2020-11-29 22:37:34,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2367 transitions. [2020-11-29 22:37:34,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-11-29 22:37:34,834 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:37:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:34,945 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2020-11-29 22:37:38,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 22:37:38,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2052 states and 2406 transitions. [2020-11-29 22:37:38,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2406 transitions. [2020-11-29 22:37:38,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-11-29 22:37:38,834 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 22:37:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:37:38,910 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:37:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:37:38,972 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:37:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:37:39,197 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:37:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:37:39,287 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:37:39,420 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 94 iterations. [2020-11-29 22:37:39,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 29.11 10:37:39 ImpRootNode [2020-11-29 22:37:39,824 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2020-11-29 22:37:39,824 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 22:37:39,825 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 22:37:39,825 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 22:37:39,825 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:35:20" (3/4) ... [2020-11-29 22:37:39,828 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 22:37:40,144 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_043d65df-3e5a-4032-b97c-e0bc837ff91b/bin/ukojak/witness.graphml [2020-11-29 22:37:40,145 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 22:37:40,146 INFO L168 Benchmark]: Toolchain (without parser) took 143021.63 ms. Allocated memory was 88.1 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 54.2 MB in the beginning and 928.8 MB in the end (delta: -874.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 16.1 GB. [2020-11-29 22:37:40,147 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 88.1 MB. Free memory was 46.1 MB in the beginning and 46.0 MB in the end (delta: 67.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 22:37:40,148 INFO L168 Benchmark]: CACSL2BoogieTranslator took 655.77 ms. Allocated memory was 88.1 MB in the beginning and 125.8 MB in the end (delta: 37.7 MB). Free memory was 54.2 MB in the beginning and 86.8 MB in the end (delta: -32.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-29 22:37:40,148 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.45 ms. Allocated memory is still 125.8 MB. Free memory was 86.8 MB in the beginning and 80.6 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-29 22:37:40,149 INFO L168 Benchmark]: Boogie Preprocessor took 61.56 ms. Allocated memory is still 125.8 MB. Free memory was 80.6 MB in the beginning and 76.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-29 22:37:40,149 INFO L168 Benchmark]: RCFGBuilder took 2816.55 ms. Allocated memory was 125.8 MB in the beginning and 165.7 MB in the end (delta: 39.8 MB). Free memory was 76.4 MB in the beginning and 126.6 MB in the end (delta: -50.2 MB). Peak memory consumption was 54.4 MB. Max. memory is 16.1 GB. [2020-11-29 22:37:40,150 INFO L168 Benchmark]: CodeCheck took 139070.61 ms. Allocated memory was 165.7 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 126.6 MB in the beginning and 966.6 MB in the end (delta: -840.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 16.1 GB. [2020-11-29 22:37:40,150 INFO L168 Benchmark]: Witness Printer took 320.26 ms. Allocated memory is still 2.2 GB. Free memory was 966.6 MB in the beginning and 928.8 MB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. [2020-11-29 22:37:40,153 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: 138.6s, OverallIterations: 94, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: -520077292 SDtfs, 1366259862 SDslu, -972994436 SDs, 0 SdLazy, 450816810 SolverSat, 195690424 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 536.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100367 GetRequests, 96353 SyntacticMatches, 3154 SemanticMatches, 860 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459537 ImplicationChecksByTransitivity, 110.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.7s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 15637 NumberOfCodeBlocks, 15637 NumberOfCodeBlocksAsserted, 94 NumberOfCheckSat, 15308 ConstructedInterpolants, 0 QuantifiedInterpolants, 11365948 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 93 InterpolantComputations, 69 PerfectInterpolantSequences, 14041/15102 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 TRUE ((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1))) [L234] a21 = 1 [L235] a8 = 14 [L236] a16 = 4 [L237] a20 = 0 [L238] a7 = 0 [L239] a17 = 0 [L240] return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L413] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L12] __assert_fail("0", "Problem01_label56.c", 4, "reach_error") VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 88.1 MB. Free memory was 46.1 MB in the beginning and 46.0 MB in the end (delta: 67.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 655.77 ms. Allocated memory was 88.1 MB in the beginning and 125.8 MB in the end (delta: 37.7 MB). Free memory was 54.2 MB in the beginning and 86.8 MB in the end (delta: -32.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 85.45 ms. Allocated memory is still 125.8 MB. Free memory was 86.8 MB in the beginning and 80.6 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 61.56 ms. Allocated memory is still 125.8 MB. Free memory was 80.6 MB in the beginning and 76.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2816.55 ms. Allocated memory was 125.8 MB in the beginning and 165.7 MB in the end (delta: 39.8 MB). Free memory was 76.4 MB in the beginning and 126.6 MB in the end (delta: -50.2 MB). Peak memory consumption was 54.4 MB. Max. memory is 16.1 GB. * CodeCheck took 139070.61 ms. Allocated memory was 165.7 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 126.6 MB in the beginning and 966.6 MB in the end (delta: -840.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 16.1 GB. * Witness Printer took 320.26 ms. Allocated memory is still 2.2 GB. Free memory was 966.6 MB in the beginning and 928.8 MB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...