./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label45_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ef5db5af-ab0f-44fa-a29e-e6280e1c85bd/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ef5db5af-ab0f-44fa-a29e-e6280e1c85bd/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ef5db5af-ab0f-44fa-a29e-e6280e1c85bd/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ef5db5af-ab0f-44fa-a29e-e6280e1c85bd/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label45_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ef5db5af-ab0f-44fa-a29e-e6280e1c85bd/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ef5db5af-ab0f-44fa-a29e-e6280e1c85bd/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 eadb33136c36588f3040fbda14d62db855361eef ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 21:53:36,687 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 21:53:36,688 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 21:53:36,694 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 21:53:36,694 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 21:53:36,694 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 21:53:36,695 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 21:53:36,696 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 21:53:36,696 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 21:53:36,697 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 21:53:36,697 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 21:53:36,697 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 21:53:36,698 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 21:53:36,698 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 21:53:36,699 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 21:53:36,699 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 21:53:36,700 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 21:53:36,700 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 21:53:36,701 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 21:53:36,702 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 21:53:36,703 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 21:53:36,703 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 21:53:36,705 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 21:53:36,705 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 21:53:36,705 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 21:53:36,706 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 21:53:36,706 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 21:53:36,707 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 21:53:36,707 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 21:53:36,708 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 21:53:36,708 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 21:53:36,708 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 21:53:36,708 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 21:53:36,708 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 21:53:36,709 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 21:53:36,709 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 21:53:36,709 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ef5db5af-ab0f-44fa-a29e-e6280e1c85bd/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-02 21:53:36,717 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 21:53:36,717 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 21:53:36,717 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 21:53:36,717 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-02 21:53:36,718 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 21:53:36,718 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 21:53:36,718 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 21:53:36,718 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 21:53:36,718 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 21:53:36,719 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 21:53:36,719 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 21:53:36,719 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 21:53:36,719 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 21:53:36,719 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 21:53:36,719 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 21:53:36,719 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 21:53:36,720 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 21:53:36,720 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 21:53:36,720 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-02 21:53:36,720 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-02 21:53:36,720 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 21:53:36,720 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 21:53:36,721 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-02 21:53:36,721 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 21:53:36,721 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 21:53:36,721 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 21:53:36,721 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-02 21:53:36,721 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 21:53:36,721 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 21:53:36,721 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_ef5db5af-ab0f-44fa-a29e-e6280e1c85bd/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 -> eadb33136c36588f3040fbda14d62db855361eef [2018-12-02 21:53:36,740 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 21:53:36,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 21:53:36,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 21:53:36,753 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 21:53:36,753 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 21:53:36,753 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ef5db5af-ab0f-44fa-a29e-e6280e1c85bd/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem02_label45_false-unreach-call_false-termination.c [2018-12-02 21:53:36,794 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ef5db5af-ab0f-44fa-a29e-e6280e1c85bd/bin-2019/ukojak/data/9fb9b249c/68db6eca408a47538e1ef73a3c0fc4da/FLAG18f299c24 [2018-12-02 21:53:37,137 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 21:53:37,137 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ef5db5af-ab0f-44fa-a29e-e6280e1c85bd/sv-benchmarks/c/eca-rers2012/Problem02_label45_false-unreach-call_false-termination.c [2018-12-02 21:53:37,143 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ef5db5af-ab0f-44fa-a29e-e6280e1c85bd/bin-2019/ukojak/data/9fb9b249c/68db6eca408a47538e1ef73a3c0fc4da/FLAG18f299c24 [2018-12-02 21:53:37,152 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ef5db5af-ab0f-44fa-a29e-e6280e1c85bd/bin-2019/ukojak/data/9fb9b249c/68db6eca408a47538e1ef73a3c0fc4da [2018-12-02 21:53:37,154 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 21:53:37,155 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 21:53:37,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 21:53:37,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 21:53:37,158 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 21:53:37,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:53:37" (1/1) ... [2018-12-02 21:53:37,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54724d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:53:37, skipping insertion in model container [2018-12-02 21:53:37,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:53:37" (1/1) ... [2018-12-02 21:53:37,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 21:53:37,188 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 21:53:37,360 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:53:37,363 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 21:53:37,446 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:53:37,456 INFO L195 MainTranslator]: Completed translation [2018-12-02 21:53:37,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:53:37 WrapperNode [2018-12-02 21:53:37,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 21:53:37,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 21:53:37,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 21:53:37,457 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 21:53:37,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:53:37" (1/1) ... [2018-12-02 21:53:37,471 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:53:37" (1/1) ... [2018-12-02 21:53:37,497 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 21:53:37,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 21:53:37,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 21:53:37,497 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 21:53:37,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:53:37" (1/1) ... [2018-12-02 21:53:37,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:53:37" (1/1) ... [2018-12-02 21:53:37,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:53:37" (1/1) ... [2018-12-02 21:53:37,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:53:37" (1/1) ... [2018-12-02 21:53:37,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:53:37" (1/1) ... [2018-12-02 21:53:37,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:53:37" (1/1) ... [2018-12-02 21:53:37,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:53:37" (1/1) ... [2018-12-02 21:53:37,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 21:53:37,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 21:53:37,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 21:53:37,526 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 21:53:37,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:53:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef5db5af-ab0f-44fa-a29e-e6280e1c85bd/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-02 21:53:37,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 21:53:37,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 21:53:38,581 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 21:53:38,581 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-02 21:53:38,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:53:38 BoogieIcfgContainer [2018-12-02 21:53:38,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 21:53:38,582 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-02 21:53:38,582 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-02 21:53:38,591 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-02 21:53:38,592 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:53:38" (1/1) ... [2018-12-02 21:53:38,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:53:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:38,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2018-12-02 21:53:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2018-12-02 21:53:38,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 21:53:38,630 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:38,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:39,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:39,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 163 states and 242 transitions. [2018-12-02 21:53:39,121 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2018-12-02 21:53:39,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 21:53:39,123 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:39,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:39,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 242 states and 327 transitions. [2018-12-02 21:53:39,541 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 327 transitions. [2018-12-02 21:53:39,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 21:53:39,542 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:39,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:39,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 246 states and 333 transitions. [2018-12-02 21:53:39,689 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 333 transitions. [2018-12-02 21:53:39,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-02 21:53:39,690 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:39,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 21:53:39,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:39,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 255 states and 348 transitions. [2018-12-02 21:53:39,906 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 348 transitions. [2018-12-02 21:53:39,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-02 21:53:39,910 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:40,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:40,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 264 states and 364 transitions. [2018-12-02 21:53:40,096 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 364 transitions. [2018-12-02 21:53:40,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 21:53:40,097 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:40,109 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:40,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:40,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 267 states and 367 transitions. [2018-12-02 21:53:40,125 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 367 transitions. [2018-12-02 21:53:40,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 21:53:40,126 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:40,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:40,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 271 states and 372 transitions. [2018-12-02 21:53:40,232 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 372 transitions. [2018-12-02 21:53:40,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 21:53:40,232 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:40,253 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 21:53:40,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:40,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 275 states and 380 transitions. [2018-12-02 21:53:40,419 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 380 transitions. [2018-12-02 21:53:40,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 21:53:40,420 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:40,442 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 21:53:40,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:40,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 278 states and 383 transitions. [2018-12-02 21:53:40,526 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 383 transitions. [2018-12-02 21:53:40,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 21:53:40,526 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:40,614 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:40,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:40,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 295 states and 413 transitions. [2018-12-02 21:53:40,924 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 413 transitions. [2018-12-02 21:53:40,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 21:53:40,925 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:40,938 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:41,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 302 states and 421 transitions. [2018-12-02 21:53:41,027 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 421 transitions. [2018-12-02 21:53:41,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 21:53:41,027 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:41,040 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:41,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:41,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 304 states and 423 transitions. [2018-12-02 21:53:41,057 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 423 transitions. [2018-12-02 21:53:41,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 21:53:41,057 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:41,071 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:41,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:41,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 308 states and 432 transitions. [2018-12-02 21:53:41,293 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 432 transitions. [2018-12-02 21:53:41,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 21:53:41,293 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:41,307 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:41,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:41,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 311 states and 436 transitions. [2018-12-02 21:53:41,395 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 436 transitions. [2018-12-02 21:53:41,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 21:53:41,396 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:41,416 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:41,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:41,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 314 states and 439 transitions. [2018-12-02 21:53:41,526 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 439 transitions. [2018-12-02 21:53:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 21:53:41,526 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:41,608 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:42,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:42,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 337 states and 470 transitions. [2018-12-02 21:53:42,068 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 470 transitions. [2018-12-02 21:53:42,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-02 21:53:42,069 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:42,167 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 21:53:42,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:42,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 416 states and 555 transitions. [2018-12-02 21:53:42,647 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 555 transitions. [2018-12-02 21:53:42,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-02 21:53:42,648 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:42,660 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:42,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:42,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 421 states and 561 transitions. [2018-12-02 21:53:42,775 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 561 transitions. [2018-12-02 21:53:42,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-02 21:53:42,776 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:42,789 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 21:53:42,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:42,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 426 states and 565 transitions. [2018-12-02 21:53:42,862 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 565 transitions. [2018-12-02 21:53:42,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 21:53:42,863 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:43,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 435 states and 577 transitions. [2018-12-02 21:53:43,092 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 577 transitions. [2018-12-02 21:53:43,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-02 21:53:43,093 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:43,113 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 21:53:43,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 437 states and 578 transitions. [2018-12-02 21:53:43,239 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 578 transitions. [2018-12-02 21:53:43,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-02 21:53:43,241 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:43,329 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:44,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 465 states and 615 transitions. [2018-12-02 21:53:44,189 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 615 transitions. [2018-12-02 21:53:44,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-02 21:53:44,190 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:44,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:44,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 468 states and 618 transitions. [2018-12-02 21:53:44,401 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 618 transitions. [2018-12-02 21:53:44,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-02 21:53:44,402 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:44,478 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:44,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:44,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 471 states and 621 transitions. [2018-12-02 21:53:44,581 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 621 transitions. [2018-12-02 21:53:44,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-02 21:53:44,582 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:44,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:44,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 474 states and 624 transitions. [2018-12-02 21:53:44,769 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 624 transitions. [2018-12-02 21:53:44,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-02 21:53:44,770 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:44,788 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:45,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:45,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 487 states and 638 transitions. [2018-12-02 21:53:45,015 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 638 transitions. [2018-12-02 21:53:45,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-02 21:53:45,016 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:45,033 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 21:53:45,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:45,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 494 states and 646 transitions. [2018-12-02 21:53:45,313 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 646 transitions. [2018-12-02 21:53:45,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-02 21:53:45,313 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:45,330 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 21:53:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 508 states and 662 transitions. [2018-12-02 21:53:45,552 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 662 transitions. [2018-12-02 21:53:45,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-02 21:53:45,552 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:45,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:45,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 523 states and 680 transitions. [2018-12-02 21:53:45,744 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 680 transitions. [2018-12-02 21:53:45,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-02 21:53:45,745 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:45,770 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 21:53:46,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:46,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 535 states and 692 transitions. [2018-12-02 21:53:46,029 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 692 transitions. [2018-12-02 21:53:46,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-02 21:53:46,030 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:46,046 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:46,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 538 states and 695 transitions. [2018-12-02 21:53:46,075 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 695 transitions. [2018-12-02 21:53:46,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-02 21:53:46,076 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:46,108 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 21:53:46,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:46,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 541 states and 697 transitions. [2018-12-02 21:53:46,191 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 697 transitions. [2018-12-02 21:53:46,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-02 21:53:46,191 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 21:53:48,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:48,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 581 states and 753 transitions. [2018-12-02 21:53:48,503 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 753 transitions. [2018-12-02 21:53:48,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-02 21:53:48,504 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:48,527 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 21:53:49,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:49,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 597 states and 769 transitions. [2018-12-02 21:53:49,060 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 769 transitions. [2018-12-02 21:53:49,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-02 21:53:49,061 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 21:53:49,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 609 states and 780 transitions. [2018-12-02 21:53:49,297 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 780 transitions. [2018-12-02 21:53:49,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-02 21:53:49,307 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:49,326 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 21:53:49,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 614 states and 785 transitions. [2018-12-02 21:53:49,645 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 785 transitions. [2018-12-02 21:53:49,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-02 21:53:49,646 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:49,662 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 21:53:49,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:49,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 618 states and 788 transitions. [2018-12-02 21:53:49,758 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 788 transitions. [2018-12-02 21:53:49,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-02 21:53:49,758 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:49,775 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:49,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:49,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 648 states and 823 transitions. [2018-12-02 21:53:49,893 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 823 transitions. [2018-12-02 21:53:49,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-02 21:53:49,894 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:49,909 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:50,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 649 states and 825 transitions. [2018-12-02 21:53:50,066 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 825 transitions. [2018-12-02 21:53:50,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-02 21:53:50,067 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:50,083 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:50,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:50,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 652 states and 828 transitions. [2018-12-02 21:53:50,226 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 828 transitions. [2018-12-02 21:53:50,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-02 21:53:50,227 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:50,245 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:50,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:50,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 668 states and 846 transitions. [2018-12-02 21:53:50,304 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 846 transitions. [2018-12-02 21:53:50,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-02 21:53:50,304 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:50,382 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:50,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:50,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 690 states and 870 transitions. [2018-12-02 21:53:50,727 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 870 transitions. [2018-12-02 21:53:50,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-02 21:53:50,727 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:50,746 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:50,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:50,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 692 states and 872 transitions. [2018-12-02 21:53:50,763 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 872 transitions. [2018-12-02 21:53:50,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-02 21:53:50,763 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:51,071 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 71 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:52,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:52,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 753 states and 946 transitions. [2018-12-02 21:53:52,989 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 946 transitions. [2018-12-02 21:53:52,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-02 21:53:52,990 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:53,041 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 71 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:53,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:53,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 756 states and 950 transitions. [2018-12-02 21:53:53,240 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 950 transitions. [2018-12-02 21:53:53,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-02 21:53:53,241 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 71 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:53,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:53,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 759 states and 954 transitions. [2018-12-02 21:53:53,505 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 954 transitions. [2018-12-02 21:53:53,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-02 21:53:53,505 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:53,541 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 71 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:53,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 762 states and 958 transitions. [2018-12-02 21:53:53,737 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 958 transitions. [2018-12-02 21:53:53,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-02 21:53:53,738 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:53,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:53,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 790 states and 990 transitions. [2018-12-02 21:53:53,863 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 990 transitions. [2018-12-02 21:53:53,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-02 21:53:53,864 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:53:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:58,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 852 states and 1060 transitions. [2018-12-02 21:53:58,495 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1060 transitions. [2018-12-02 21:53:58,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-02 21:53:58,496 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:58,530 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-02 21:53:59,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:53:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 872 states and 1083 transitions. [2018-12-02 21:53:59,076 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1083 transitions. [2018-12-02 21:53:59,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-02 21:53:59,076 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:53:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:53:59,226 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 21:54:00,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 903 states and 1121 transitions. [2018-12-02 21:54:00,724 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1121 transitions. [2018-12-02 21:54:00,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-02 21:54:00,724 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 21:54:00,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:00,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 915 states and 1132 transitions. [2018-12-02 21:54:00,868 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1132 transitions. [2018-12-02 21:54:00,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-02 21:54:00,869 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:00,889 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 21:54:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:01,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 920 states and 1136 transitions. [2018-12-02 21:54:01,008 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1136 transitions. [2018-12-02 21:54:01,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-02 21:54:01,008 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:01,047 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:54:01,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:01,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 926 states and 1148 transitions. [2018-12-02 21:54:01,592 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1148 transitions. [2018-12-02 21:54:01,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-02 21:54:01,593 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:01,608 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-02 21:54:01,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:01,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 929 states and 1151 transitions. [2018-12-02 21:54:01,762 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1151 transitions. [2018-12-02 21:54:01,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-02 21:54:01,762 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:01,979 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 78 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:54:02,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:02,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 955 states and 1184 transitions. [2018-12-02 21:54:02,995 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1184 transitions. [2018-12-02 21:54:02,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-02 21:54:02,996 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:03,037 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 78 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:54:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 968 states and 1197 transitions. [2018-12-02 21:54:03,603 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1197 transitions. [2018-12-02 21:54:03,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-02 21:54:03,604 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:03,643 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 78 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:54:03,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:03,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 980 states and 1208 transitions. [2018-12-02 21:54:03,917 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1208 transitions. [2018-12-02 21:54:03,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-02 21:54:03,918 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:03,939 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-02 21:54:04,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:04,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 985 states and 1213 transitions. [2018-12-02 21:54:04,181 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1213 transitions. [2018-12-02 21:54:04,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-02 21:54:04,182 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:04,203 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-02 21:54:04,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:04,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 986 states and 1214 transitions. [2018-12-02 21:54:04,441 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1214 transitions. [2018-12-02 21:54:04,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-02 21:54:04,441 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:04,462 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-02 21:54:04,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 989 states and 1216 transitions. [2018-12-02 21:54:04,588 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1216 transitions. [2018-12-02 21:54:04,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-02 21:54:04,589 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:04,613 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-02 21:54:06,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:06,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1015 states and 1243 transitions. [2018-12-02 21:54:06,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1243 transitions. [2018-12-02 21:54:06,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-02 21:54:06,232 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:06,486 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-02 21:54:07,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:07,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1073 states and 1304 transitions. [2018-12-02 21:54:07,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1304 transitions. [2018-12-02 21:54:07,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-02 21:54:07,089 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:07,112 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:54:07,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:07,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1074 states and 1306 transitions. [2018-12-02 21:54:07,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1306 transitions. [2018-12-02 21:54:07,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-02 21:54:07,325 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:54:07,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1077 states and 1309 transitions. [2018-12-02 21:54:07,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1309 transitions. [2018-12-02 21:54:07,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-02 21:54:07,489 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:07,585 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:54:08,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:08,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1092 states and 1328 transitions. [2018-12-02 21:54:08,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1328 transitions. [2018-12-02 21:54:08,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-02 21:54:08,012 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:08,089 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:54:08,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:08,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1095 states and 1331 transitions. [2018-12-02 21:54:08,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1331 transitions. [2018-12-02 21:54:08,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-02 21:54:08,316 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 21:54:08,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:08,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1099 states and 1335 transitions. [2018-12-02 21:54:08,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1335 transitions. [2018-12-02 21:54:08,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-02 21:54:08,363 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 21:54:08,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:08,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1100 states and 1336 transitions. [2018-12-02 21:54:08,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1336 transitions. [2018-12-02 21:54:08,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-02 21:54:08,445 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 21:54:08,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:08,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1120 states and 1359 transitions. [2018-12-02 21:54:08,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1359 transitions. [2018-12-02 21:54:08,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-02 21:54:08,820 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 128 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 21:54:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1145 states and 1390 transitions. [2018-12-02 21:54:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1390 transitions. [2018-12-02 21:54:11,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-02 21:54:11,218 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:11,258 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 128 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 21:54:11,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:11,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1148 states and 1393 transitions. [2018-12-02 21:54:11,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1393 transitions. [2018-12-02 21:54:11,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-02 21:54:11,555 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 128 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 21:54:11,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:11,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1151 states and 1396 transitions. [2018-12-02 21:54:11,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1396 transitions. [2018-12-02 21:54:11,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-02 21:54:11,906 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:11,927 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 21:54:11,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:11,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1155 states and 1401 transitions. [2018-12-02 21:54:11,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1401 transitions. [2018-12-02 21:54:11,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-02 21:54:11,952 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 21:54:12,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1160 states and 1405 transitions. [2018-12-02 21:54:12,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1405 transitions. [2018-12-02 21:54:12,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-02 21:54:12,295 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-02 21:54:13,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1175 states and 1421 transitions. [2018-12-02 21:54:13,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1421 transitions. [2018-12-02 21:54:13,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-02 21:54:13,316 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:13,412 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-02 21:54:14,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:14,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1188 states and 1433 transitions. [2018-12-02 21:54:14,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1433 transitions. [2018-12-02 21:54:14,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-02 21:54:14,176 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:14,217 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 84 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 21:54:14,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:14,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1207 states and 1455 transitions. [2018-12-02 21:54:14,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1455 transitions. [2018-12-02 21:54:14,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-02 21:54:14,594 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:14,631 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 21:54:15,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:15,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1232 states and 1482 transitions. [2018-12-02 21:54:15,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1482 transitions. [2018-12-02 21:54:15,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-02 21:54:15,815 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:15,839 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 21:54:15,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1238 states and 1487 transitions. [2018-12-02 21:54:15,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1487 transitions. [2018-12-02 21:54:15,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-02 21:54:15,865 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:15,902 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 97 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 21:54:16,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:16,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1245 states and 1495 transitions. [2018-12-02 21:54:16,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1495 transitions. [2018-12-02 21:54:16,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-02 21:54:16,319 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:16,340 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 21:54:17,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1283 states and 1538 transitions. [2018-12-02 21:54:17,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1538 transitions. [2018-12-02 21:54:17,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-02 21:54:17,014 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:17,038 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 21:54:17,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:17,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1286 states and 1540 transitions. [2018-12-02 21:54:17,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1540 transitions. [2018-12-02 21:54:17,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-02 21:54:17,172 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:17,206 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 21:54:17,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:17,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1292 states and 1545 transitions. [2018-12-02 21:54:17,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1545 transitions. [2018-12-02 21:54:17,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-02 21:54:17,356 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:17,390 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 106 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 21:54:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:18,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1313 states and 1565 transitions. [2018-12-02 21:54:18,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1565 transitions. [2018-12-02 21:54:18,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-02 21:54:18,783 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:18,909 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-02 21:54:19,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:19,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1323 states and 1582 transitions. [2018-12-02 21:54:19,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1582 transitions. [2018-12-02 21:54:19,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-02 21:54:19,892 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:19,915 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-02 21:54:20,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:20,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1326 states and 1585 transitions. [2018-12-02 21:54:20,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1585 transitions. [2018-12-02 21:54:20,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-02 21:54:20,150 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:20,176 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-02 21:54:20,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:20,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1329 states and 1588 transitions. [2018-12-02 21:54:20,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1588 transitions. [2018-12-02 21:54:20,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-02 21:54:20,449 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:20,708 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 99 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:54:24,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:24,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1362 states and 1625 transitions. [2018-12-02 21:54:24,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1625 transitions. [2018-12-02 21:54:24,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-02 21:54:24,015 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:24,049 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 99 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:54:24,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:24,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1365 states and 1628 transitions. [2018-12-02 21:54:24,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1628 transitions. [2018-12-02 21:54:24,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-02 21:54:24,337 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:24,487 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-02 21:54:25,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1370 states and 1636 transitions. [2018-12-02 21:54:25,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1636 transitions. [2018-12-02 21:54:25,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-02 21:54:25,124 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:25,151 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-02 21:54:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:25,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1375 states and 1640 transitions. [2018-12-02 21:54:25,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1640 transitions. [2018-12-02 21:54:25,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-02 21:54:25,300 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:25,391 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-02 21:54:25,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1378 states and 1643 transitions. [2018-12-02 21:54:25,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1643 transitions. [2018-12-02 21:54:25,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-02 21:54:25,456 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:25,673 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 21:54:26,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:26,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1454 states and 1726 transitions. [2018-12-02 21:54:26,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1726 transitions. [2018-12-02 21:54:26,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-02 21:54:26,728 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:26,751 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-02 21:54:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1457 states and 1729 transitions. [2018-12-02 21:54:26,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1729 transitions. [2018-12-02 21:54:26,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-02 21:54:26,773 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:27,780 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 146 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:54:33,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:33,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1532 states and 1825 transitions. [2018-12-02 21:54:33,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1825 transitions. [2018-12-02 21:54:33,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-02 21:54:33,723 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:33,841 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 146 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:54:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:35,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1543 states and 1837 transitions. [2018-12-02 21:54:35,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 1837 transitions. [2018-12-02 21:54:35,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-02 21:54:35,455 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:35,515 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-12-02 21:54:35,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:35,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1548 states and 1845 transitions. [2018-12-02 21:54:35,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 1845 transitions. [2018-12-02 21:54:35,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-02 21:54:35,907 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:35,966 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-12-02 21:54:36,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:36,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1552 states and 1850 transitions. [2018-12-02 21:54:36,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 1850 transitions. [2018-12-02 21:54:36,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-02 21:54:36,457 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:36,740 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:54:39,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:39,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1563 states and 1866 transitions. [2018-12-02 21:54:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1866 transitions. [2018-12-02 21:54:39,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-02 21:54:39,689 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:39,717 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:54:40,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:40,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1568 states and 1870 transitions. [2018-12-02 21:54:40,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 1870 transitions. [2018-12-02 21:54:40,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-02 21:54:40,059 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:40,085 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-02 21:54:40,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1573 states and 1874 transitions. [2018-12-02 21:54:40,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1874 transitions. [2018-12-02 21:54:40,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-02 21:54:40,485 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:40,618 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 109 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-02 21:54:40,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:40,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1605 states and 1905 transitions. [2018-12-02 21:54:40,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1905 transitions. [2018-12-02 21:54:40,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-02 21:54:40,712 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 109 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-02 21:54:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1609 states and 1911 transitions. [2018-12-02 21:54:41,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 1911 transitions. [2018-12-02 21:54:41,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-02 21:54:41,033 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:41,060 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 109 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-02 21:54:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:41,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1612 states and 1914 transitions. [2018-12-02 21:54:41,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 1914 transitions. [2018-12-02 21:54:41,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-02 21:54:41,315 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 109 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-02 21:54:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:41,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1615 states and 1917 transitions. [2018-12-02 21:54:41,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 1917 transitions. [2018-12-02 21:54:41,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-02 21:54:41,650 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:41,767 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 153 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:54:42,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:42,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1622 states and 1930 transitions. [2018-12-02 21:54:42,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1930 transitions. [2018-12-02 21:54:42,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-02 21:54:42,660 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:42,773 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 153 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:54:43,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:43,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1624 states and 1932 transitions. [2018-12-02 21:54:43,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 1932 transitions. [2018-12-02 21:54:43,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-02 21:54:43,131 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:43,199 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 148 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 21:54:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:43,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1628 states and 1937 transitions. [2018-12-02 21:54:43,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 1937 transitions. [2018-12-02 21:54:43,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-02 21:54:43,743 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 21:54:45,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:45,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 1708 states and 2017 transitions. [2018-12-02 21:54:45,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2017 transitions. [2018-12-02 21:54:45,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-02 21:54:45,184 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:45,555 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-12-02 21:54:52,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:52,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 1771 states and 2086 transitions. [2018-12-02 21:54:52,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2086 transitions. [2018-12-02 21:54:52,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-02 21:54:52,131 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 122 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 21:54:53,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 1804 states and 2127 transitions. [2018-12-02 21:54:53,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2127 transitions. [2018-12-02 21:54:53,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-02 21:54:53,639 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 122 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 21:54:54,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:54,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 1807 states and 2130 transitions. [2018-12-02 21:54:54,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2130 transitions. [2018-12-02 21:54:54,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-02 21:54:54,026 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:54,139 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 122 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 21:54:54,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:54,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 1810 states and 2133 transitions. [2018-12-02 21:54:54,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2133 transitions. [2018-12-02 21:54:54,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-02 21:54:54,427 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:54,521 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 122 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 21:54:54,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:54,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 1813 states and 2136 transitions. [2018-12-02 21:54:54,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2136 transitions. [2018-12-02 21:54:54,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-02 21:54:54,911 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 114 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-02 21:54:59,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:54:59,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 1894 states and 2240 transitions. [2018-12-02 21:54:59,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2240 transitions. [2018-12-02 21:54:59,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-02 21:54:59,338 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:54:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:54:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 114 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-02 21:55:00,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:55:00,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 1936 states and 2282 transitions. [2018-12-02 21:55:00,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2282 transitions. [2018-12-02 21:55:00,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-02 21:55:00,385 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:55:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:00,420 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 114 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-02 21:55:02,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:55:02,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 1962 states and 2313 transitions. [2018-12-02 21:55:02,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2313 transitions. [2018-12-02 21:55:02,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-02 21:55:02,405 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:55:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:02,441 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 114 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-02 21:55:03,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:55:03,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 1975 states and 2326 transitions. [2018-12-02 21:55:03,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2326 transitions. [2018-12-02 21:55:03,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-02 21:55:03,489 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:55:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:03,523 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 114 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-02 21:55:04,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:55:04,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 1987 states and 2337 transitions. [2018-12-02 21:55:04,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2337 transitions. [2018-12-02 21:55:04,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-02 21:55:04,387 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:55:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:04,415 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-02 21:55:04,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:55:04,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 1992 states and 2344 transitions. [2018-12-02 21:55:04,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2344 transitions. [2018-12-02 21:55:04,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-02 21:55:04,776 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:55:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:04,808 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-02 21:55:04,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:55:04,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 1994 states and 2345 transitions. [2018-12-02 21:55:04,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2345 transitions. [2018-12-02 21:55:04,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-02 21:55:04,977 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:55:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:05,095 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 21:55:05,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:55:05,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 2000 states and 2354 transitions. [2018-12-02 21:55:05,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2354 transitions. [2018-12-02 21:55:05,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-02 21:55:05,641 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:55:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:05,670 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-02 21:55:08,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:55:08,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2404 states to 2048 states and 2404 transitions. [2018-12-02 21:55:08,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2404 transitions. [2018-12-02 21:55:08,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-02 21:55:08,442 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:55:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-02 21:55:08,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:55:08,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2053 states and 2408 transitions. [2018-12-02 21:55:08,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2408 transitions. [2018-12-02 21:55:08,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-12-02 21:55:08,874 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:55:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:08,900 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-02 21:55:09,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:55:09,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2074 states and 2428 transitions. [2018-12-02 21:55:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 2428 transitions. [2018-12-02 21:55:09,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-02 21:55:09,516 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:55:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:09,556 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-02 21:55:10,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:55:10,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2078 states and 2432 transitions. [2018-12-02 21:55:10,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 2432 transitions. [2018-12-02 21:55:10,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-02 21:55:10,140 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:55:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 21:55:20,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:55:20,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2108 states and 2469 transitions. [2018-12-02 21:55:20,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 2469 transitions. [2018-12-02 21:55:20,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-02 21:55:20,702 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:55:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:20,793 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 21:55:22,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:55:22,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 2124 states and 2484 transitions. [2018-12-02 21:55:22,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 2484 transitions. [2018-12-02 21:55:22,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-02 21:55:22,972 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:55:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:23,830 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 21:55:28,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:55:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2177 states and 2539 transitions. [2018-12-02 21:55:28,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2177 states and 2539 transitions. [2018-12-02 21:55:28,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-02 21:55:28,706 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:55:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:28,792 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 21:55:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:55:32,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2210 states and 2571 transitions. [2018-12-02 21:55:32,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 2571 transitions. [2018-12-02 21:55:32,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-02 21:55:32,484 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:55:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:32,569 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 21:55:33,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:55:33,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2223 states and 2583 transitions. [2018-12-02 21:55:33,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 2583 transitions. [2018-12-02 21:55:33,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-02 21:55:33,736 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:55:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:34,760 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 175 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:55:39,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:55:39,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2262 states and 2634 transitions. [2018-12-02 21:55:39,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 2634 transitions. [2018-12-02 21:55:39,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-02 21:55:39,181 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:55:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 175 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:55:40,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:55:40,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2269 states and 2640 transitions. [2018-12-02 21:55:40,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2269 states and 2640 transitions. [2018-12-02 21:55:40,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-02 21:55:40,471 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:55:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:40,844 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 175 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:55:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:55:40,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2273 states and 2643 transitions. [2018-12-02 21:55:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 2643 transitions. [2018-12-02 21:55:40,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-02 21:55:40,933 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:55:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 174 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:55:42,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:55:42,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2292 states and 2666 transitions. [2018-12-02 21:55:42,350 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 2666 transitions. [2018-12-02 21:55:42,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-02 21:55:42,351 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:55:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:42,720 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 174 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 21:55:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:55:43,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2294 states and 2669 transitions. [2018-12-02 21:55:43,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 2669 transitions. [2018-12-02 21:55:43,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-02 21:55:43,501 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:55:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:44,695 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 21:55:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:55:48,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2329 states and 2711 transitions. [2018-12-02 21:55:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 2711 transitions. [2018-12-02 21:55:48,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-02 21:55:48,641 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:55:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 21:55:53,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:55:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2748 states to 2367 states and 2748 transitions. [2018-12-02 21:55:53,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2748 transitions. [2018-12-02 21:55:53,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-02 21:55:53,754 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:55:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:53,858 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 21:55:55,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:55:55,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2767 states to 2386 states and 2767 transitions. [2018-12-02 21:55:55,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 2767 transitions. [2018-12-02 21:55:55,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-02 21:55:55,335 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:55:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:55:56,310 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 21:56:06,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:56:06,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2423 states and 2806 transitions. [2018-12-02 21:56:06,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 2806 transitions. [2018-12-02 21:56:06,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-02 21:56:06,366 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:56:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:56:06,460 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 21:56:08,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:56:08,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2433 states and 2814 transitions. [2018-12-02 21:56:08,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 2814 transitions. [2018-12-02 21:56:08,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-02 21:56:08,296 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:56:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:56:08,439 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-02 21:56:12,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:56:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2451 states and 2840 transitions. [2018-12-02 21:56:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 2840 transitions. [2018-12-02 21:56:12,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-02 21:56:12,511 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:56:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:56:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-02 21:56:14,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:56:14,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2461 states and 2850 transitions. [2018-12-02 21:56:14,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 2850 transitions. [2018-12-02 21:56:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-02 21:56:14,127 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:56:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:56:14,270 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-02 21:56:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:56:14,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2464 states and 2853 transitions. [2018-12-02 21:56:14,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2464 states and 2853 transitions. [2018-12-02 21:56:14,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-12-02 21:56:14,723 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:56:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:56:14,754 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-02 21:56:14,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:56:14,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2467 states and 2855 transitions. [2018-12-02 21:56:14,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 2855 transitions. [2018-12-02 21:56:14,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-02 21:56:14,988 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:56:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:56:15,074 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-02 21:56:16,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:56:16,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2468 states and 2857 transitions. [2018-12-02 21:56:16,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 2857 transitions. [2018-12-02 21:56:16,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-02 21:56:16,210 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:56:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:56:16,303 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-02 21:56:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:56:21,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2482 states and 2871 transitions. [2018-12-02 21:56:21,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 2871 transitions. [2018-12-02 21:56:21,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-02 21:56:21,256 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:56:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:56:21,344 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-02 21:56:22,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:56:22,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2494 states and 2882 transitions. [2018-12-02 21:56:22,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2494 states and 2882 transitions. [2018-12-02 21:56:22,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-02 21:56:22,402 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:56:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:56:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-12-02 21:56:23,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:56:23,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2569 states and 2959 transitions. [2018-12-02 21:56:23,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 2959 transitions. [2018-12-02 21:56:23,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-12-02 21:56:23,586 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:56:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:56:23,650 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-02 21:56:23,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 21:56:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2970 states to 2581 states and 2970 transitions. [2018-12-02 21:56:23,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2581 states and 2970 transitions. [2018-12-02 21:56:23,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-12-02 21:56:23,884 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 21:56:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:56:24,050 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 152 iterations. [2018-12-02 21:56:24,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 09:56:24 ImpRootNode [2018-12-02 21:56:24,153 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-02 21:56:24,153 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 21:56:24,153 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 21:56:24,153 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 21:56:24,153 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:53:38" (3/4) ... [2018-12-02 21:56:24,155 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 21:56:24,260 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ef5db5af-ab0f-44fa-a29e-e6280e1c85bd/bin-2019/ukojak/witness.graphml [2018-12-02 21:56:24,260 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 21:56:24,261 INFO L168 Benchmark]: Toolchain (without parser) took 167106.46 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 794.8 MB). Free memory was 945.3 MB in the beginning and 833.2 MB in the end (delta: 112.0 MB). Peak memory consumption was 906.9 MB. Max. memory is 11.5 GB. [2018-12-02 21:56:24,262 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 974.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:56:24,262 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -148.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. [2018-12-02 21:56:24,262 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 21:56:24,262 INFO L168 Benchmark]: Boogie Preprocessor took 28.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 21:56:24,262 INFO L168 Benchmark]: RCFGBuilder took 1055.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 858.6 MB in the end (delta: 224.3 MB). Peak memory consumption was 224.3 MB. Max. memory is 11.5 GB. [2018-12-02 21:56:24,262 INFO L168 Benchmark]: CodeCheck took 165570.91 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 689.4 MB). Free memory was 858.6 MB in the beginning and 871.5 MB in the end (delta: -13.0 MB). Peak memory consumption was 676.5 MB. Max. memory is 11.5 GB. [2018-12-02 21:56:24,262 INFO L168 Benchmark]: Witness Printer took 107.44 ms. Allocated memory is still 1.8 GB. Free memory was 871.5 MB in the beginning and 833.2 MB in the end (delta: 38.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. [2018-12-02 21:56:24,263 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, 227 locations, 1 error locations. UNSAFE Result, 165.4s OverallTime, 152 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1191241480 SDtfs, -1933145950 SDslu, -1425722960 SDs, 0 SdLazy, 414145808 SolverSat, 187559842 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 444.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163772 GetRequests, 158870 SyntacticMatches, 3588 SemanticMatches, 1314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348552 ImplicationChecksByTransitivity, 148.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 24993 NumberOfCodeBlocks, 24993 NumberOfCodeBlocksAsserted, 152 NumberOfCheckSat, 24615 ConstructedInterpolants, 0 QuantifiedInterpolants, 19126614 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 151 InterpolantComputations, 106 PerfectInterpolantSequences, 17102/17820 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: 418]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L235] a28 = 9 [L236] return 23; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L395] a19 = 0 [L396] a28 = 7 [L397] return 25; VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND TRUE ((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1)) [L149] a11 = 1 [L150] a19 = 1 [L151] a28 = 10 [L152] a25 = 1 [L153] return -1; VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L418] __VERIFIER_error() VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 974.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 301.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -148.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1055.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 858.6 MB in the end (delta: 224.3 MB). Peak memory consumption was 224.3 MB. Max. memory is 11.5 GB. * CodeCheck took 165570.91 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 689.4 MB). Free memory was 858.6 MB in the beginning and 871.5 MB in the end (delta: -13.0 MB). Peak memory consumption was 676.5 MB. Max. memory is 11.5 GB. * Witness Printer took 107.44 ms. Allocated memory is still 1.8 GB. Free memory was 871.5 MB in the beginning and 833.2 MB in the end (delta: 38.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...