./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label44_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fe77958b-9ca4-4cb6-b4ee-70245ef19cbf/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fe77958b-9ca4-4cb6-b4ee-70245ef19cbf/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fe77958b-9ca4-4cb6-b4ee-70245ef19cbf/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fe77958b-9ca4-4cb6-b4ee-70245ef19cbf/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label44_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fe77958b-9ca4-4cb6-b4ee-70245ef19cbf/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fe77958b-9ca4-4cb6-b4ee-70245ef19cbf/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2239efb232e6960cd140d60028ed9446da6b2730 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:59:41,102 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:59:41,103 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:59:41,109 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:59:41,110 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:59:41,110 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:59:41,111 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:59:41,112 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:59:41,113 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:59:41,114 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:59:41,115 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:59:41,115 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:59:41,115 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:59:41,116 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:59:41,117 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:59:41,117 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:59:41,118 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:59:41,119 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:59:41,120 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:59:41,121 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:59:41,122 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:59:41,123 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:59:41,124 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:59:41,125 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:59:41,125 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:59:41,125 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:59:41,126 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:59:41,126 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:59:41,127 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:59:41,128 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:59:41,128 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:59:41,129 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:59:41,129 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:59:41,129 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:59:41,130 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:59:41,130 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:59:41,130 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fe77958b-9ca4-4cb6-b4ee-70245ef19cbf/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 12:59:41,140 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:59:41,140 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:59:41,141 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:59:41,141 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 12:59:41,141 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:59:41,142 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:59:41,142 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:59:41,142 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:59:41,142 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:59:41,142 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:59:41,142 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:59:41,142 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:59:41,142 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:59:41,142 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:59:41,143 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:59:41,143 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:59:41,143 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:59:41,144 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 12:59:41,144 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 12:59:41,144 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:59:41,144 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:59:41,144 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 12:59:41,144 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:59:41,144 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:59:41,144 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:59:41,144 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 12:59:41,145 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:59:41,145 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:59:41,145 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_fe77958b-9ca4-4cb6-b4ee-70245ef19cbf/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2239efb232e6960cd140d60028ed9446da6b2730 [2018-11-10 12:59:41,165 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:59:41,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:59:41,176 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:59:41,177 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:59:41,178 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:59:41,178 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fe77958b-9ca4-4cb6-b4ee-70245ef19cbf/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label44_false-unreach-call_false-termination.c [2018-11-10 12:59:41,218 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fe77958b-9ca4-4cb6-b4ee-70245ef19cbf/bin-2019/ukojak/data/cee52d330/255a8e56e94b46979a3b814d2cf106cd/FLAGfff89ec1d [2018-11-10 12:59:41,674 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:59:41,675 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fe77958b-9ca4-4cb6-b4ee-70245ef19cbf/sv-benchmarks/c/eca-rers2012/Problem01_label44_false-unreach-call_false-termination.c [2018-11-10 12:59:41,684 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fe77958b-9ca4-4cb6-b4ee-70245ef19cbf/bin-2019/ukojak/data/cee52d330/255a8e56e94b46979a3b814d2cf106cd/FLAGfff89ec1d [2018-11-10 12:59:41,699 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fe77958b-9ca4-4cb6-b4ee-70245ef19cbf/bin-2019/ukojak/data/cee52d330/255a8e56e94b46979a3b814d2cf106cd [2018-11-10 12:59:41,702 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:59:41,703 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:59:41,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:59:41,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:59:41,707 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:59:41,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:59:41" (1/1) ... [2018-11-10 12:59:41,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e7f328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:41, skipping insertion in model container [2018-11-10 12:59:41,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:59:41" (1/1) ... [2018-11-10 12:59:41,717 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:59:41,749 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:59:41,982 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:59:41,985 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:59:42,055 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:59:42,068 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:59:42,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:42 WrapperNode [2018-11-10 12:59:42,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:59:42,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:59:42,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:59:42,069 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:59:42,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:42" (1/1) ... [2018-11-10 12:59:42,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:42" (1/1) ... [2018-11-10 12:59:42,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:59:42,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:59:42,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:59:42,186 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:59:42,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:42" (1/1) ... [2018-11-10 12:59:42,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:42" (1/1) ... [2018-11-10 12:59:42,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:42" (1/1) ... [2018-11-10 12:59:42,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:42" (1/1) ... [2018-11-10 12:59:42,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:42" (1/1) ... [2018-11-10 12:59:42,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:42" (1/1) ... [2018-11-10 12:59:42,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:42" (1/1) ... [2018-11-10 12:59:42,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:59:42,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:59:42,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:59:42,228 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:59:42,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe77958b-9ca4-4cb6-b4ee-70245ef19cbf/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 12:59:42,283 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 12:59:42,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:59:42,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:59:43,795 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:59:43,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:59:43 BoogieIcfgContainer [2018-11-10 12:59:43,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:59:43,797 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 12:59:43,797 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 12:59:43,806 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 12:59:43,806 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:59:43" (1/1) ... [2018-11-10 12:59:43,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:43,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:43,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-11-10 12:59:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-11-10 12:59:43,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 12:59:43,849 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:44,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:44,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:44,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 147 states and 239 transitions. [2018-11-10 12:59:44,527 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 239 transitions. [2018-11-10 12:59:44,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 12:59:44,528 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:59:44,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:44,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 148 states and 240 transitions. [2018-11-10 12:59:44,770 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 240 transitions. [2018-11-10 12:59:44,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 12:59:44,772 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:44,804 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:44,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:44,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 153 states and 248 transitions. [2018-11-10 12:59:44,911 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 248 transitions. [2018-11-10 12:59:44,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 12:59:44,915 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:45,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:45,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 162 states and 264 transitions. [2018-11-10 12:59:45,340 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 264 transitions. [2018-11-10 12:59:45,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 12:59:45,343 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:59:45,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:45,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 163 states and 265 transitions. [2018-11-10 12:59:45,461 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 265 transitions. [2018-11-10 12:59:45,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 12:59:45,462 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:45,507 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 12:59:45,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:45,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 176 states and 286 transitions. [2018-11-10 12:59:45,830 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 286 transitions. [2018-11-10 12:59:45,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 12:59:45,833 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:45,871 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:45,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 182 states and 293 transitions. [2018-11-10 12:59:45,968 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 293 transitions. [2018-11-10 12:59:45,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 12:59:45,969 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:45,998 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:46,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:46,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 183 states and 294 transitions. [2018-11-10 12:59:46,037 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 294 transitions. [2018-11-10 12:59:46,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 12:59:46,038 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:46,131 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:46,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 198 states and 314 transitions. [2018-11-10 12:59:46,588 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 314 transitions. [2018-11-10 12:59:46,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 12:59:46,588 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:46,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:46,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 199 states and 316 transitions. [2018-11-10 12:59:46,612 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 316 transitions. [2018-11-10 12:59:46,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 12:59:46,613 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:46,654 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:46,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 209 states and 335 transitions. [2018-11-10 12:59:46,933 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 335 transitions. [2018-11-10 12:59:46,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 12:59:46,934 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:46,955 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:47,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:47,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 210 states and 337 transitions. [2018-11-10 12:59:47,034 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 337 transitions. [2018-11-10 12:59:47,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 12:59:47,034 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:47,058 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:59:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:47,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 211 states and 338 transitions. [2018-11-10 12:59:47,107 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 338 transitions. [2018-11-10 12:59:47,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 12:59:47,108 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:47,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:47,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 214 states and 341 transitions. [2018-11-10 12:59:47,147 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 341 transitions. [2018-11-10 12:59:47,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 12:59:47,148 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:47,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:47,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 225 states and 359 transitions. [2018-11-10 12:59:47,855 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 359 transitions. [2018-11-10 12:59:47,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 12:59:47,856 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:47,874 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:59:47,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:47,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 227 states and 360 transitions. [2018-11-10 12:59:47,985 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 360 transitions. [2018-11-10 12:59:47,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 12:59:47,986 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 12:59:48,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 232 states and 365 transitions. [2018-11-10 12:59:48,229 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 365 transitions. [2018-11-10 12:59:48,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 12:59:48,230 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:48,280 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:48,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:48,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 238 states and 375 transitions. [2018-11-10 12:59:48,462 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 375 transitions. [2018-11-10 12:59:48,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-10 12:59:48,463 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:49,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 249 states and 391 transitions. [2018-11-10 12:59:49,011 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 391 transitions. [2018-11-10 12:59:49,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 12:59:49,012 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 12:59:49,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:49,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 251 states and 392 transitions. [2018-11-10 12:59:49,100 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 392 transitions. [2018-11-10 12:59:49,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-10 12:59:49,100 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:49,199 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:49,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:49,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 276 states and 426 transitions. [2018-11-10 12:59:49,955 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 426 transitions. [2018-11-10 12:59:49,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-10 12:59:49,956 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:49,971 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:59:50,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:50,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 287 states and 440 transitions. [2018-11-10 12:59:50,382 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 440 transitions. [2018-11-10 12:59:50,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-10 12:59:50,383 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:50,428 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:50,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:50,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 290 states and 443 transitions. [2018-11-10 12:59:50,445 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 443 transitions. [2018-11-10 12:59:50,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 12:59:50,446 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:50,460 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 12:59:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 292 states and 448 transitions. [2018-11-10 12:59:50,596 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 448 transitions. [2018-11-10 12:59:50,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 12:59:50,597 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:51,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:51,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 306 states and 470 transitions. [2018-11-10 12:59:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 470 transitions. [2018-11-10 12:59:51,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 12:59:51,396 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:51,413 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:51,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:51,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 311 states and 477 transitions. [2018-11-10 12:59:51,637 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 477 transitions. [2018-11-10 12:59:51,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 12:59:51,637 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:51,654 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:52,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:52,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 326 states and 492 transitions. [2018-11-10 12:59:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 492 transitions. [2018-11-10 12:59:52,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 12:59:52,277 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:52,340 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:52,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:52,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 337 states and 504 transitions. [2018-11-10 12:59:52,965 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 504 transitions. [2018-11-10 12:59:52,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-10 12:59:52,966 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:52,992 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:53,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:53,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 339 states and 507 transitions. [2018-11-10 12:59:53,047 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 507 transitions. [2018-11-10 12:59:53,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 12:59:53,049 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:53,386 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:54,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 364 states and 547 transitions. [2018-11-10 12:59:54,874 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 547 transitions. [2018-11-10 12:59:54,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 12:59:54,875 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:55,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:55,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 369 states and 554 transitions. [2018-11-10 12:59:55,246 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 554 transitions. [2018-11-10 12:59:55,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 12:59:55,246 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:55,340 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:55,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:55,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 379 states and 564 transitions. [2018-11-10 12:59:55,763 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 564 transitions. [2018-11-10 12:59:55,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 12:59:55,763 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:55,855 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:56,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:56,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 380 states and 565 transitions. [2018-11-10 12:59:56,009 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 565 transitions. [2018-11-10 12:59:56,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 12:59:56,009 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:56,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:56,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 386 states and 571 transitions. [2018-11-10 12:59:56,242 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 571 transitions. [2018-11-10 12:59:56,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 12:59:56,242 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:56,320 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:56,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:56,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 387 states and 573 transitions. [2018-11-10 12:59:56,472 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 573 transitions. [2018-11-10 12:59:56,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 12:59:56,474 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:56,564 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:56,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:56,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 388 states and 574 transitions. [2018-11-10 12:59:56,726 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 574 transitions. [2018-11-10 12:59:56,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 12:59:56,726 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:57,070 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:58,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:58,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 402 states and 595 transitions. [2018-11-10 12:59:58,214 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 595 transitions. [2018-11-10 12:59:58,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 12:59:58,214 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:58,231 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:59:58,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:58,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 413 states and 608 transitions. [2018-11-10 12:59:58,952 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 608 transitions. [2018-11-10 12:59:58,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 12:59:58,953 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:58,969 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 12:59:59,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:59,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 420 states and 617 transitions. [2018-11-10 12:59:59,322 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 617 transitions. [2018-11-10 12:59:59,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 12:59:59,322 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:59,342 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 12:59:59,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:59,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 421 states and 618 transitions. [2018-11-10 12:59:59,537 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 618 transitions. [2018-11-10 12:59:59,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 12:59:59,538 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:59,556 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 12:59:59,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:59:59,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 422 states and 618 transitions. [2018-11-10 12:59:59,636 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 618 transitions. [2018-11-10 12:59:59,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 12:59:59,636 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:59:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:59,655 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:00,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 439 states and 639 transitions. [2018-11-10 13:00:00,638 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 639 transitions. [2018-11-10 13:00:00,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 13:00:00,638 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:01,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:01,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 458 states and 667 transitions. [2018-11-10 13:00:01,852 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 667 transitions. [2018-11-10 13:00:01,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 13:00:01,853 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:01,901 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:02,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 475 states and 684 transitions. [2018-11-10 13:00:02,242 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 684 transitions. [2018-11-10 13:00:02,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 13:00:02,242 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:02,263 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:02,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:02,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 476 states and 684 transitions. [2018-11-10 13:00:02,366 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 684 transitions. [2018-11-10 13:00:02,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 13:00:02,366 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:02,421 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:02,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:02,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 547 states and 764 transitions. [2018-11-10 13:00:02,825 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 764 transitions. [2018-11-10 13:00:02,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-10 13:00:02,826 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:03,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 556 states and 772 transitions. [2018-11-10 13:00:03,660 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 772 transitions. [2018-11-10 13:00:03,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 13:00:03,661 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:03,679 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:03,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:03,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 565 states and 783 transitions. [2018-11-10 13:00:03,715 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 783 transitions. [2018-11-10 13:00:03,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 13:00:03,716 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:03,731 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:04,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:04,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 574 states and 797 transitions. [2018-11-10 13:00:04,262 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 797 transitions. [2018-11-10 13:00:04,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 13:00:04,262 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:04,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 585 states and 807 transitions. [2018-11-10 13:00:04,787 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 807 transitions. [2018-11-10 13:00:04,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 13:00:04,788 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:04,807 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:05,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:05,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 586 states and 807 transitions. [2018-11-10 13:00:05,005 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 807 transitions. [2018-11-10 13:00:05,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-10 13:00:05,006 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 599 states and 822 transitions. [2018-11-10 13:00:05,283 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 822 transitions. [2018-11-10 13:00:05,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 13:00:05,284 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:00:05,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:05,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 601 states and 823 transitions. [2018-11-10 13:00:05,390 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 823 transitions. [2018-11-10 13:00:05,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 13:00:05,391 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:05,407 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:05,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:05,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 605 states and 826 transitions. [2018-11-10 13:00:05,529 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 826 transitions. [2018-11-10 13:00:05,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 13:00:05,529 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:05,673 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:05,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 619 states and 842 transitions. [2018-11-10 13:00:05,911 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 842 transitions. [2018-11-10 13:00:05,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 13:00:05,912 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:05,931 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:00:06,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 621 states and 843 transitions. [2018-11-10 13:00:06,018 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 843 transitions. [2018-11-10 13:00:06,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 13:00:06,019 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:06,035 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:00:06,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:06,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 623 states and 846 transitions. [2018-11-10 13:00:06,053 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 846 transitions. [2018-11-10 13:00:06,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 13:00:06,054 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:06,349 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:08,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:08,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 668 states and 894 transitions. [2018-11-10 13:00:08,140 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 894 transitions. [2018-11-10 13:00:08,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 13:00:08,140 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 45 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:11,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:11,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 758 states and 998 transitions. [2018-11-10 13:00:11,442 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 998 transitions. [2018-11-10 13:00:11,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 13:00:11,442 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:11,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:11,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 772 states and 1017 transitions. [2018-11-10 13:00:11,966 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1017 transitions. [2018-11-10 13:00:11,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 13:00:11,967 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:11,988 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:12,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:12,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 780 states and 1027 transitions. [2018-11-10 13:00:12,594 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1027 transitions. [2018-11-10 13:00:12,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 13:00:12,594 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:12,615 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:12,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:12,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 785 states and 1031 transitions. [2018-11-10 13:00:12,794 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1031 transitions. [2018-11-10 13:00:12,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 13:00:12,795 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:12,939 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:00:13,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:13,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 799 states and 1062 transitions. [2018-11-10 13:00:13,799 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1062 transitions. [2018-11-10 13:00:13,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 13:00:13,800 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:13,879 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:00:14,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 804 states and 1069 transitions. [2018-11-10 13:00:14,232 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1069 transitions. [2018-11-10 13:00:14,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 13:00:14,233 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:14,300 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:00:14,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:14,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 809 states and 1080 transitions. [2018-11-10 13:00:14,685 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1080 transitions. [2018-11-10 13:00:14,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 13:00:14,686 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:00:17,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:17,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 850 states and 1133 transitions. [2018-11-10 13:00:17,128 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1133 transitions. [2018-11-10 13:00:17,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 13:00:17,129 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:00:17,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:17,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 866 states and 1147 transitions. [2018-11-10 13:00:17,743 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1147 transitions. [2018-11-10 13:00:17,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 13:00:17,744 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:17,779 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:00:18,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:18,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 870 states and 1152 transitions. [2018-11-10 13:00:18,081 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1152 transitions. [2018-11-10 13:00:18,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 13:00:18,081 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:18,110 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-10 13:00:18,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:18,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 951 states and 1239 transitions. [2018-11-10 13:00:18,613 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1239 transitions. [2018-11-10 13:00:18,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-10 13:00:18,614 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:18,838 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 13:00:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:20,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 961 states and 1264 transitions. [2018-11-10 13:00:20,103 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1264 transitions. [2018-11-10 13:00:20,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 13:00:20,104 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 13:00:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:20,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 964 states and 1267 transitions. [2018-11-10 13:00:20,342 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1267 transitions. [2018-11-10 13:00:20,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 13:00:20,343 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 13:00:20,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:20,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 979 states and 1286 transitions. [2018-11-10 13:00:20,853 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1286 transitions. [2018-11-10 13:00:20,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 13:00:20,854 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 13:00:22,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:22,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1011 states and 1323 transitions. [2018-11-10 13:00:22,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1323 transitions. [2018-11-10 13:00:22,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 13:00:22,212 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 13:00:22,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:22,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1012 states and 1323 transitions. [2018-11-10 13:00:22,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1323 transitions. [2018-11-10 13:00:22,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-10 13:00:22,276 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:22,296 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 13:00:22,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:22,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1014 states and 1326 transitions. [2018-11-10 13:00:22,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1326 transitions. [2018-11-10 13:00:22,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 13:00:22,318 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:22,342 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 13:00:23,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1042 states and 1359 transitions. [2018-11-10 13:00:23,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1359 transitions. [2018-11-10 13:00:23,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 13:00:23,103 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:23,128 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:23,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:23,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1056 states and 1373 transitions. [2018-11-10 13:00:23,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1373 transitions. [2018-11-10 13:00:23,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-10 13:00:23,186 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:23,410 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 13:00:25,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1087 states and 1416 transitions. [2018-11-10 13:00:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1416 transitions. [2018-11-10 13:00:25,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 13:00:25,149 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:25,176 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 13:00:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1096 states and 1425 transitions. [2018-11-10 13:00:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1425 transitions. [2018-11-10 13:00:25,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-10 13:00:25,378 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:25,405 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 13:00:25,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:25,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1108 states and 1439 transitions. [2018-11-10 13:00:25,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1439 transitions. [2018-11-10 13:00:25,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-10 13:00:25,876 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:25,953 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:00:26,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:26,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1135 states and 1475 transitions. [2018-11-10 13:00:26,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1475 transitions. [2018-11-10 13:00:26,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-10 13:00:26,443 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:26,506 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:00:26,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:26,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1140 states and 1479 transitions. [2018-11-10 13:00:26,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1479 transitions. [2018-11-10 13:00:26,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-10 13:00:26,994 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:27,652 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:29,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:29,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1190 states and 1536 transitions. [2018-11-10 13:00:29,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1536 transitions. [2018-11-10 13:00:29,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-10 13:00:29,647 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:29,783 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-10 13:00:30,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:30,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1195 states and 1543 transitions. [2018-11-10 13:00:30,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1543 transitions. [2018-11-10 13:00:30,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-10 13:00:30,078 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:30,117 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 13:00:31,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:31,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1224 states and 1576 transitions. [2018-11-10 13:00:31,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1576 transitions. [2018-11-10 13:00:31,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-10 13:00:31,182 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:31,236 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 13:00:31,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:31,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1226 states and 1577 transitions. [2018-11-10 13:00:31,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1577 transitions. [2018-11-10 13:00:31,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-10 13:00:31,549 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:31,590 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 103 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 13:00:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:33,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1293 states and 1658 transitions. [2018-11-10 13:00:33,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1658 transitions. [2018-11-10 13:00:33,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-10 13:00:33,452 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:33,490 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 103 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 13:00:33,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:33,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1298 states and 1663 transitions. [2018-11-10 13:00:33,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1663 transitions. [2018-11-10 13:00:33,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-10 13:00:33,805 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:33,841 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 103 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 13:00:34,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:34,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1303 states and 1669 transitions. [2018-11-10 13:00:34,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1669 transitions. [2018-11-10 13:00:34,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-10 13:00:34,138 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 103 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 13:00:34,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:34,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1304 states and 1669 transitions. [2018-11-10 13:00:34,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1669 transitions. [2018-11-10 13:00:34,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 13:00:34,464 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:34,520 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 13:00:35,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:35,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1331 states and 1699 transitions. [2018-11-10 13:00:35,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1699 transitions. [2018-11-10 13:00:35,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 13:00:35,376 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 13:00:36,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:36,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1346 states and 1721 transitions. [2018-11-10 13:00:36,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1721 transitions. [2018-11-10 13:00:36,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 13:00:36,900 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:36,961 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 13:00:37,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:37,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1347 states and 1722 transitions. [2018-11-10 13:00:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1722 transitions. [2018-11-10 13:00:37,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 13:00:37,225 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:37,281 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 13:00:38,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:38,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1350 states and 1724 transitions. [2018-11-10 13:00:38,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1724 transitions. [2018-11-10 13:00:38,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 13:00:38,103 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:38,166 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 13:00:38,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:38,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1358 states and 1735 transitions. [2018-11-10 13:00:38,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1735 transitions. [2018-11-10 13:00:38,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 13:00:38,998 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:39,053 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 13:00:39,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:39,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1373 states and 1751 transitions. [2018-11-10 13:00:39,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1751 transitions. [2018-11-10 13:00:39,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 13:00:39,360 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 13:00:40,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1375 states and 1751 transitions. [2018-11-10 13:00:40,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1751 transitions. [2018-11-10 13:00:40,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-10 13:00:40,024 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:40,055 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 13:00:40,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:40,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1410 states and 1788 transitions. [2018-11-10 13:00:40,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 1788 transitions. [2018-11-10 13:00:40,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 13:00:40,619 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:40,653 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 13:00:43,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1473 states and 1858 transitions. [2018-11-10 13:00:43,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 1858 transitions. [2018-11-10 13:00:43,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 13:00:43,281 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:43,315 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 13:00:43,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:43,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1475 states and 1860 transitions. [2018-11-10 13:00:43,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1860 transitions. [2018-11-10 13:00:43,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 13:00:43,642 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 13:00:43,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:43,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1482 states and 1867 transitions. [2018-11-10 13:00:43,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1867 transitions. [2018-11-10 13:00:43,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 13:00:43,830 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:43,861 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 13:00:44,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:44,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1509 states and 1899 transitions. [2018-11-10 13:00:44,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1899 transitions. [2018-11-10 13:00:44,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 13:00:44,550 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:44,598 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 13:00:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:45,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1528 states and 1920 transitions. [2018-11-10 13:00:45,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1920 transitions. [2018-11-10 13:00:45,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 13:00:45,448 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:45,483 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 13:00:45,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:45,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1530 states and 1922 transitions. [2018-11-10 13:00:45,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 1922 transitions. [2018-11-10 13:00:45,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-10 13:00:45,771 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 13:00:46,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:46,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1552 states and 1950 transitions. [2018-11-10 13:00:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 1950 transitions. [2018-11-10 13:00:46,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-10 13:00:46,740 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:46,856 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 13:00:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:47,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1576 states and 1973 transitions. [2018-11-10 13:00:47,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1973 transitions. [2018-11-10 13:00:47,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-10 13:00:47,338 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:47,370 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 13:00:48,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:48,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1583 states and 1979 transitions. [2018-11-10 13:00:48,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 1979 transitions. [2018-11-10 13:00:48,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 13:00:48,480 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:48,705 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 118 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:51,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:51,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 1647 states and 2053 transitions. [2018-11-10 13:00:51,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2053 transitions. [2018-11-10 13:00:51,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 13:00:51,586 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:51,675 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 118 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:53,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:53,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 1663 states and 2069 transitions. [2018-11-10 13:00:53,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2069 transitions. [2018-11-10 13:00:53,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 13:00:53,386 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:53,479 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 118 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:54,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:54,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 1675 states and 2081 transitions. [2018-11-10 13:00:54,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2081 transitions. [2018-11-10 13:00:54,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 13:00:54,066 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:54,151 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 118 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:56,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:56,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 1692 states and 2101 transitions. [2018-11-10 13:00:56,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 2101 transitions. [2018-11-10 13:00:56,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 13:00:56,010 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:56,099 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 118 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:00:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:00:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 1694 states and 2102 transitions. [2018-11-10 13:00:56,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2102 transitions. [2018-11-10 13:00:56,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 13:00:56,274 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:00:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:56,461 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 113 iterations. [2018-11-10 13:00:56,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 01:00:56 ImpRootNode [2018-11-10 13:00:56,558 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 13:00:56,559 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:00:56,559 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:00:56,559 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:00:56,561 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:59:43" (3/4) ... [2018-11-10 13:00:56,563 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 13:00:56,676 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fe77958b-9ca4-4cb6-b4ee-70245ef19cbf/bin-2019/ukojak/witness.graphml [2018-11-10 13:00:56,676 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:00:56,677 INFO L168 Benchmark]: Toolchain (without parser) took 74974.97 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 952.2 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 574.4 MB. Max. memory is 11.5 GB. [2018-11-10 13:00:56,678 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:00:56,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.33 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 917.3 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:00:56,678 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 917.3 MB in the beginning and 1.1 GB in the end (delta: -214.0 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2018-11-10 13:00:56,679 INFO L168 Benchmark]: Boogie Preprocessor took 41.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-10 13:00:56,679 INFO L168 Benchmark]: RCFGBuilder took 1568.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 891.0 MB in the end (delta: 236.8 MB). Peak memory consumption was 236.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:00:56,679 INFO L168 Benchmark]: CodeCheck took 72762.31 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 891.0 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 369.5 MB. Max. memory is 11.5 GB. [2018-11-10 13:00:56,679 INFO L168 Benchmark]: Witness Printer took 117.17 ms. Allocated memory is still 2.6 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:00:56,681 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 199 locations, 1 error locations. UNSAFE Result, 72.6s OverallTime, 113 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -964620000 SDtfs, -1567910276 SDslu, 1428720320 SDs, 0 SdLazy, -802593180 SolverSat, 463664100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 239.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104049 GetRequests, 101658 SyntacticMatches, 1249 SemanticMatches, 1142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862911 ImplicationChecksByTransitivity, 62.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 14565 NumberOfCodeBlocks, 14565 NumberOfCodeBlocksAsserted, 113 NumberOfCheckSat, 14274 ConstructedInterpolants, 0 QuantifiedInterpolants, 5221791 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 112 InterpolantComputations, 93 PerfectInterpolantSequences, 7863/8078 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 428]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND TRUE (((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)) [L32] a16 = 5 [L33] a20 = 0 [L34] RET return 24; VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND 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=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, 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 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=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, 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] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, 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] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, 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] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, 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] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, 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] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, 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] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, 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] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, 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] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, 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] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, 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] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, 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] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, 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] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, 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] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, 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] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, 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] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, 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] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, 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] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND TRUE ((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15))) [L266] a17 = 0 [L267] RET return 24; VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND 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=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] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=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] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=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] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=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] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=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] [L312] COND TRUE ((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5)) [L313] a8 = 13 [L314] a16 = 4 [L315] RET return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L415] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L418] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L421] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L424] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L427] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L428] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 365.33 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 917.3 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 116.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 917.3 MB in the beginning and 1.1 GB in the end (delta: -214.0 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1568.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 891.0 MB in the end (delta: 236.8 MB). Peak memory consumption was 236.8 MB. Max. memory is 11.5 GB. * CodeCheck took 72762.31 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 891.0 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 369.5 MB. Max. memory is 11.5 GB. * Witness Printer took 117.17 ms. Allocated memory is still 2.6 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...