./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label56_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a0461008-ae24-436b-b732-d1bfbba3ede4/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a0461008-ae24-436b-b732-d1bfbba3ede4/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a0461008-ae24-436b-b732-d1bfbba3ede4/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a0461008-ae24-436b-b732-d1bfbba3ede4/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label56_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a0461008-ae24-436b-b732-d1bfbba3ede4/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a0461008-ae24-436b-b732-d1bfbba3ede4/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 08b7aa26e03024d3f4d1247f9fe7868985d0c8c2 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:13:52,662 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:13:52,664 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:13:52,672 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:13:52,672 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:13:52,673 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:13:52,675 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:13:52,676 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:13:52,678 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:13:52,679 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:13:52,680 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:13:52,680 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:13:52,681 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:13:52,682 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:13:52,683 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:13:52,684 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:13:52,685 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:13:52,687 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:13:52,689 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:13:52,690 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:13:52,692 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:13:52,693 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:13:52,695 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:13:52,695 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:13:52,695 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:13:52,696 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:13:52,697 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:13:52,698 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:13:52,699 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:13:52,700 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:13:52,700 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:13:52,701 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:13:52,701 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:13:52,701 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:13:52,703 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:13:52,704 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:13:52,704 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a0461008-ae24-436b-b732-d1bfbba3ede4/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 10:13:52,717 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:13:52,717 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:13:52,718 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:13:52,719 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 10:13:52,719 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:13:52,720 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:13:52,720 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:13:52,720 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:13:52,720 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:13:52,720 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:13:52,720 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:13:52,721 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:13:52,721 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:13:52,721 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:13:52,721 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:13:52,721 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:13:52,721 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:13:52,722 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 10:13:52,724 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 10:13:52,724 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:13:52,724 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:13:52,724 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 10:13:52,725 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:13:52,725 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:13:52,725 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:13:52,725 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 10:13:52,725 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:13:52,725 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 10:13:52,726 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_a0461008-ae24-436b-b732-d1bfbba3ede4/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 -> 08b7aa26e03024d3f4d1247f9fe7868985d0c8c2 [2018-11-10 10:13:52,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:13:52,767 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:13:52,769 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:13:52,770 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:13:52,771 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:13:52,771 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a0461008-ae24-436b-b732-d1bfbba3ede4/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label56_false-unreach-call_false-termination.c [2018-11-10 10:13:52,816 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a0461008-ae24-436b-b732-d1bfbba3ede4/bin-2019/ukojak/data/cb9f6128b/8106c931208f4227bee1220e45931a8b/FLAG48d5dc150 [2018-11-10 10:13:53,206 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:13:53,207 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a0461008-ae24-436b-b732-d1bfbba3ede4/sv-benchmarks/c/eca-rers2012/Problem01_label56_false-unreach-call_false-termination.c [2018-11-10 10:13:53,216 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a0461008-ae24-436b-b732-d1bfbba3ede4/bin-2019/ukojak/data/cb9f6128b/8106c931208f4227bee1220e45931a8b/FLAG48d5dc150 [2018-11-10 10:13:53,229 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a0461008-ae24-436b-b732-d1bfbba3ede4/bin-2019/ukojak/data/cb9f6128b/8106c931208f4227bee1220e45931a8b [2018-11-10 10:13:53,233 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:13:53,234 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:13:53,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:13:53,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:13:53,239 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:13:53,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:13:53" (1/1) ... [2018-11-10 10:13:53,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e7f328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:13:53, skipping insertion in model container [2018-11-10 10:13:53,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:13:53" (1/1) ... [2018-11-10 10:13:53,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:13:53,286 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:13:53,539 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:13:53,542 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:13:53,609 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:13:53,622 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:13:53,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:13:53 WrapperNode [2018-11-10 10:13:53,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:13:53,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:13:53,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:13:53,624 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:13:53,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:13:53" (1/1) ... [2018-11-10 10:13:53,646 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:13:53" (1/1) ... [2018-11-10 10:13:53,752 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:13:53,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:13:53,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:13:53,753 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:13:53,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:13:53" (1/1) ... [2018-11-10 10:13:53,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:13:53" (1/1) ... [2018-11-10 10:13:53,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:13:53" (1/1) ... [2018-11-10 10:13:53,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:13:53" (1/1) ... [2018-11-10 10:13:53,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:13:53" (1/1) ... [2018-11-10 10:13:53,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:13:53" (1/1) ... [2018-11-10 10:13:53,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:13:53" (1/1) ... [2018-11-10 10:13:53,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:13:53,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:13:53,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:13:53,803 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:13:53,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:13:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0461008-ae24-436b-b732-d1bfbba3ede4/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 10:13:53,857 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 10:13:53,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:13:53,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:13:55,417 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:13:55,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:13:55 BoogieIcfgContainer [2018-11-10 10:13:55,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:13:55,419 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 10:13:55,419 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 10:13:55,427 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 10:13:55,427 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:13:55" (1/1) ... [2018-11-10 10:13:55,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:13:55,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:55,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-11-10 10:13:55,467 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-11-10 10:13:55,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 10:13:55,471 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:55,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:13:56,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:56,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 147 states and 222 transitions. [2018-11-10 10:13:56,212 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 222 transitions. [2018-11-10 10:13:56,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 10:13:56,215 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:56,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:13:56,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:56,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 148 states and 223 transitions. [2018-11-10 10:13:56,431 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 223 transitions. [2018-11-10 10:13:56,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 10:13:56,433 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:56,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:13:56,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 154 states and 233 transitions. [2018-11-10 10:13:56,585 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 233 transitions. [2018-11-10 10:13:56,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 10:13:56,587 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:56,646 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:13:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 225 states and 307 transitions. [2018-11-10 10:13:57,042 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 307 transitions. [2018-11-10 10:13:57,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 10:13:57,044 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:57,107 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:13:57,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:57,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 233 states and 319 transitions. [2018-11-10 10:13:57,316 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 319 transitions. [2018-11-10 10:13:57,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 10:13:57,320 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:57,382 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:13:57,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:57,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 242 states and 336 transitions. [2018-11-10 10:13:57,769 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 336 transitions. [2018-11-10 10:13:57,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 10:13:57,771 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:13:57,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:57,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 246 states and 340 transitions. [2018-11-10 10:13:57,946 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 340 transitions. [2018-11-10 10:13:57,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 10:13:57,947 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:57,972 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:13:58,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:58,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 248 states and 342 transitions. [2018-11-10 10:13:58,074 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 342 transitions. [2018-11-10 10:13:58,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 10:13:58,075 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:58,098 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:13:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 253 states and 347 transitions. [2018-11-10 10:13:58,148 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 347 transitions. [2018-11-10 10:13:58,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 10:13:58,149 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 10:13:58,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:58,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 262 states and 358 transitions. [2018-11-10 10:13:58,310 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 358 transitions. [2018-11-10 10:13:58,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 10:13:58,311 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:58,340 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:13:58,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:58,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 263 states and 360 transitions. [2018-11-10 10:13:58,425 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 360 transitions. [2018-11-10 10:13:58,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 10:13:58,427 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:58,457 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:13:58,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 269 states and 366 transitions. [2018-11-10 10:13:58,803 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 366 transitions. [2018-11-10 10:13:58,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 10:13:58,804 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:58,843 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 10:13:58,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:58,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 272 states and 370 transitions. [2018-11-10 10:13:58,940 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 370 transitions. [2018-11-10 10:13:58,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 10:13:58,941 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:58,975 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 10:13:59,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 277 states and 375 transitions. [2018-11-10 10:13:59,044 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 375 transitions. [2018-11-10 10:13:59,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-10 10:13:59,045 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:59,084 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 10:13:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 278 states and 376 transitions. [2018-11-10 10:13:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 376 transitions. [2018-11-10 10:13:59,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 10:13:59,178 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:59,281 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 10:13:59,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:13:59,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 293 states and 398 transitions. [2018-11-10 10:13:59,846 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 398 transitions. [2018-11-10 10:13:59,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 10:13:59,847 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:13:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:13:59,926 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 317 states and 430 transitions. [2018-11-10 10:14:01,119 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 430 transitions. [2018-11-10 10:14:01,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 10:14:01,120 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:01,152 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:01,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:01,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 321 states and 435 transitions. [2018-11-10 10:14:01,357 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 435 transitions. [2018-11-10 10:14:01,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 10:14:01,358 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:01,392 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:01,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:01,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 323 states and 436 transitions. [2018-11-10 10:14:01,566 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 436 transitions. [2018-11-10 10:14:01,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-10 10:14:01,567 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:01,654 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 10:14:01,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:01,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 324 states and 438 transitions. [2018-11-10 10:14:01,793 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 438 transitions. [2018-11-10 10:14:01,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 10:14:01,794 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:01,820 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 10:14:01,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:01,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 326 states and 440 transitions. [2018-11-10 10:14:01,842 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 440 transitions. [2018-11-10 10:14:01,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 10:14:01,843 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:01,979 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 10:14:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:02,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 337 states and 453 transitions. [2018-11-10 10:14:02,654 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 453 transitions. [2018-11-10 10:14:02,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 10:14:02,655 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:02,682 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 10:14:02,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:02,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 340 states and 456 transitions. [2018-11-10 10:14:02,709 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 456 transitions. [2018-11-10 10:14:02,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-10 10:14:02,710 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:02,738 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 10:14:02,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:02,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 342 states and 458 transitions. [2018-11-10 10:14:02,783 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 458 transitions. [2018-11-10 10:14:02,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-10 10:14:02,784 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:02,810 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 10:14:03,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 351 states and 469 transitions. [2018-11-10 10:14:03,030 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 469 transitions. [2018-11-10 10:14:03,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-10 10:14:03,031 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:03,132 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 10:14:03,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 376 states and 499 transitions. [2018-11-10 10:14:03,743 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 499 transitions. [2018-11-10 10:14:03,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 10:14:03,744 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:03,854 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 10:14:04,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:04,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 391 states and 518 transitions. [2018-11-10 10:14:04,323 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 518 transitions. [2018-11-10 10:14:04,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-10 10:14:04,324 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 10:14:05,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:05,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 417 states and 549 transitions. [2018-11-10 10:14:05,791 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 549 transitions. [2018-11-10 10:14:05,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 10:14:05,792 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:06,079 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 10:14:06,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:06,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 431 states and 568 transitions. [2018-11-10 10:14:06,689 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 568 transitions. [2018-11-10 10:14:06,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 10:14:06,690 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:06,728 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 10:14:07,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:07,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 434 states and 573 transitions. [2018-11-10 10:14:07,069 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 573 transitions. [2018-11-10 10:14:07,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 10:14:07,070 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:07,097 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 10:14:07,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:07,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 448 states and 588 transitions. [2018-11-10 10:14:07,577 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 588 transitions. [2018-11-10 10:14:07,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 10:14:07,578 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:07,615 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 10:14:07,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:07,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 454 states and 595 transitions. [2018-11-10 10:14:07,781 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 595 transitions. [2018-11-10 10:14:07,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-10 10:14:07,783 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 10:14:07,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:07,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 455 states and 596 transitions. [2018-11-10 10:14:07,868 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 596 transitions. [2018-11-10 10:14:07,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:14:07,902 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:07,940 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 10:14:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 458 states and 600 transitions. [2018-11-10 10:14:08,102 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 600 transitions. [2018-11-10 10:14:08,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 10:14:08,104 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:08,278 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 10:14:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:08,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 465 states and 610 transitions. [2018-11-10 10:14:08,898 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 610 transitions. [2018-11-10 10:14:08,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 10:14:08,899 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:08,924 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 10:14:08,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:08,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 474 states and 619 transitions. [2018-11-10 10:14:08,970 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 619 transitions. [2018-11-10 10:14:08,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 10:14:08,971 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:08,993 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 10:14:09,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:09,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 475 states and 620 transitions. [2018-11-10 10:14:09,006 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 620 transitions. [2018-11-10 10:14:09,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:14:09,007 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:09,364 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:10,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 524 states and 676 transitions. [2018-11-10 10:14:10,955 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 676 transitions. [2018-11-10 10:14:10,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 10:14:10,955 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:11,119 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:14:11,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:11,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 534 states and 694 transitions. [2018-11-10 10:14:11,800 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 694 transitions. [2018-11-10 10:14:11,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 10:14:11,801 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:11,842 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:13,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 583 states and 747 transitions. [2018-11-10 10:14:13,441 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 747 transitions. [2018-11-10 10:14:13,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 10:14:13,441 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:13,476 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 600 states and 766 transitions. [2018-11-10 10:14:14,073 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 766 transitions. [2018-11-10 10:14:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 10:14:14,074 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:14,099 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:14,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:14,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 605 states and 774 transitions. [2018-11-10 10:14:14,161 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 774 transitions. [2018-11-10 10:14:14,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 10:14:14,162 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:14,206 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 10:14:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:15,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 655 states and 831 transitions. [2018-11-10 10:14:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 831 transitions. [2018-11-10 10:14:15,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 10:14:15,548 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 10:14:16,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:16,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 665 states and 850 transitions. [2018-11-10 10:14:16,897 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 850 transitions. [2018-11-10 10:14:16,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-10 10:14:16,898 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:17,162 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 10:14:19,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 709 states and 900 transitions. [2018-11-10 10:14:19,072 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 900 transitions. [2018-11-10 10:14:19,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-10 10:14:19,073 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:19,195 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 10:14:20,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:20,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 732 states and 925 transitions. [2018-11-10 10:14:20,179 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 925 transitions. [2018-11-10 10:14:20,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-10 10:14:20,180 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:20,645 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 10:14:22,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:22,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 746 states and 947 transitions. [2018-11-10 10:14:22,084 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 947 transitions. [2018-11-10 10:14:22,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 10:14:22,085 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:22,132 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-10 10:14:22,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 750 states and 950 transitions. [2018-11-10 10:14:22,329 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 950 transitions. [2018-11-10 10:14:22,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 10:14:22,330 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:22,375 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 10:14:22,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:22,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 767 states and 968 transitions. [2018-11-10 10:14:22,481 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 968 transitions. [2018-11-10 10:14:22,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-10 10:14:22,482 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:22,536 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 10:14:22,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:22,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 769 states and 970 transitions. [2018-11-10 10:14:22,568 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 970 transitions. [2018-11-10 10:14:22,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-10 10:14:22,569 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:23,073 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:24,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:24,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 795 states and 1008 transitions. [2018-11-10 10:14:24,580 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1008 transitions. [2018-11-10 10:14:24,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-10 10:14:24,581 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:24,685 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:24,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:24,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 805 states and 1017 transitions. [2018-11-10 10:14:24,978 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1017 transitions. [2018-11-10 10:14:24,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 10:14:24,979 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:25,468 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 114 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 10:14:27,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:27,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 828 states and 1045 transitions. [2018-11-10 10:14:27,051 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1045 transitions. [2018-11-10 10:14:27,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 10:14:27,052 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:27,130 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 114 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 10:14:27,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:27,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 841 states and 1059 transitions. [2018-11-10 10:14:27,955 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1059 transitions. [2018-11-10 10:14:27,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-10 10:14:27,956 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:28,352 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 10:14:29,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:29,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 866 states and 1086 transitions. [2018-11-10 10:14:29,726 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1086 transitions. [2018-11-10 10:14:29,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 10:14:29,727 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:29,776 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 10:14:29,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:29,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 867 states and 1087 transitions. [2018-11-10 10:14:29,800 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1087 transitions. [2018-11-10 10:14:29,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 10:14:29,801 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:29,853 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 10:14:29,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:29,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 868 states and 1087 transitions. [2018-11-10 10:14:29,985 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1087 transitions. [2018-11-10 10:14:29,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-10 10:14:29,986 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:30,049 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 10:14:30,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:30,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 877 states and 1097 transitions. [2018-11-10 10:14:30,862 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1097 transitions. [2018-11-10 10:14:30,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-10 10:14:30,864 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:31,115 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 10:14:32,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:32,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 887 states and 1113 transitions. [2018-11-10 10:14:32,129 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1113 transitions. [2018-11-10 10:14:32,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-10 10:14:32,130 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:32,652 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 10:14:34,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:34,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 940 states and 1177 transitions. [2018-11-10 10:14:34,890 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1177 transitions. [2018-11-10 10:14:34,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-10 10:14:34,891 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:35,084 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 10:14:35,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:35,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 957 states and 1193 transitions. [2018-11-10 10:14:35,440 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1193 transitions. [2018-11-10 10:14:35,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-10 10:14:35,441 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 10:14:35,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:35,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 958 states and 1195 transitions. [2018-11-10 10:14:35,583 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1195 transitions. [2018-11-10 10:14:35,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-10 10:14:35,584 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:35,996 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:37,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:37,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 978 states and 1222 transitions. [2018-11-10 10:14:37,658 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1222 transitions. [2018-11-10 10:14:37,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-10 10:14:37,659 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:37,707 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 10:14:38,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:38,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1036 states and 1283 transitions. [2018-11-10 10:14:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1283 transitions. [2018-11-10 10:14:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-10 10:14:38,668 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:38,716 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 10:14:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:38,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1037 states and 1283 transitions. [2018-11-10 10:14:38,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1283 transitions. [2018-11-10 10:14:38,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-10 10:14:38,965 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:39,016 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 97 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 10:14:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:41,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1104 states and 1358 transitions. [2018-11-10 10:14:41,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1358 transitions. [2018-11-10 10:14:41,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-10 10:14:41,130 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:41,172 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 97 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 10:14:41,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:41,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1109 states and 1363 transitions. [2018-11-10 10:14:41,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1363 transitions. [2018-11-10 10:14:41,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-10 10:14:41,534 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:41,815 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 101 proven. 26 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 10:14:43,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:43,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1138 states and 1407 transitions. [2018-11-10 10:14:43,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1407 transitions. [2018-11-10 10:14:43,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-10 10:14:43,536 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:43,670 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-10 10:14:44,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:44,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1162 states and 1435 transitions. [2018-11-10 10:14:44,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1435 transitions. [2018-11-10 10:14:44,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-10 10:14:44,727 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:44,760 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 10:14:44,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:44,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1163 states and 1436 transitions. [2018-11-10 10:14:44,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1436 transitions. [2018-11-10 10:14:44,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-10 10:14:44,946 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:45,080 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 106 proven. 36 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 10:14:45,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:45,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1175 states and 1454 transitions. [2018-11-10 10:14:45,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1454 transitions. [2018-11-10 10:14:45,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 10:14:45,880 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:45,989 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-10 10:14:46,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:46,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1181 states and 1462 transitions. [2018-11-10 10:14:46,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1462 transitions. [2018-11-10 10:14:46,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-10 10:14:46,318 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:50,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1215 states and 1501 transitions. [2018-11-10 10:14:50,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1501 transitions. [2018-11-10 10:14:50,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-10 10:14:50,086 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:50,175 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:50,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1220 states and 1506 transitions. [2018-11-10 10:14:50,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1506 transitions. [2018-11-10 10:14:50,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-10 10:14:50,650 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:14:51,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1221 states and 1507 transitions. [2018-11-10 10:14:51,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1507 transitions. [2018-11-10 10:14:51,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 10:14:51,014 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 10:14:53,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:53,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1239 states and 1531 transitions. [2018-11-10 10:14:53,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1531 transitions. [2018-11-10 10:14:53,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 10:14:53,972 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:54,107 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-10 10:14:54,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1307 states and 1601 transitions. [2018-11-10 10:14:54,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1601 transitions. [2018-11-10 10:14:54,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-10 10:14:54,534 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 153 proven. 26 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 10:14:56,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:56,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1381 states and 1683 transitions. [2018-11-10 10:14:56,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1683 transitions. [2018-11-10 10:14:56,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-10 10:14:56,713 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:56,818 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 153 proven. 26 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 10:14:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:57,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1382 states and 1683 transitions. [2018-11-10 10:14:57,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1683 transitions. [2018-11-10 10:14:57,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-10 10:14:57,118 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:57,150 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-10 10:14:57,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:14:57,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1396 states and 1700 transitions. [2018-11-10 10:14:57,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1700 transitions. [2018-11-10 10:14:57,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 10:14:57,677 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:14:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:14:58,749 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 10:15:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:02,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1441 states and 1747 transitions. [2018-11-10 10:15:02,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1747 transitions. [2018-11-10 10:15:02,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 10:15:02,585 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:02,703 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 10:15:03,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:03,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1444 states and 1751 transitions. [2018-11-10 10:15:03,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1751 transitions. [2018-11-10 10:15:03,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-10 10:15:03,218 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-10 10:15:04,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:04,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1461 states and 1772 transitions. [2018-11-10 10:15:04,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 1772 transitions. [2018-11-10 10:15:04,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-10 10:15:04,290 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:04,342 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 10:15:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1491 states and 1815 transitions. [2018-11-10 10:15:07,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1815 transitions. [2018-11-10 10:15:07,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-10 10:15:07,182 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:07,236 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 10:15:08,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:08,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1499 states and 1824 transitions. [2018-11-10 10:15:08,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1824 transitions. [2018-11-10 10:15:08,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-10 10:15:08,214 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:08,256 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 10:15:08,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:08,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1501 states and 1826 transitions. [2018-11-10 10:15:08,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1826 transitions. [2018-11-10 10:15:08,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-10 10:15:08,712 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:08,755 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 10:15:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:09,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1506 states and 1830 transitions. [2018-11-10 10:15:09,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 1830 transitions. [2018-11-10 10:15:09,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-10 10:15:09,267 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:09,309 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-10 10:15:09,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:09,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1577 states and 1904 transitions. [2018-11-10 10:15:09,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 1904 transitions. [2018-11-10 10:15:09,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-10 10:15:09,881 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:10,613 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 265 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 10:15:13,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:13,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1592 states and 1928 transitions. [2018-11-10 10:15:13,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 1928 transitions. [2018-11-10 10:15:13,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-10 10:15:13,603 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 265 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 10:15:15,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1600 states and 1938 transitions. [2018-11-10 10:15:15,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 1938 transitions. [2018-11-10 10:15:15,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-10 10:15:15,002 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:15,087 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 265 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 10:15:16,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:16,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1611 states and 1951 transitions. [2018-11-10 10:15:16,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 1951 transitions. [2018-11-10 10:15:16,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-10 10:15:16,458 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 265 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 10:15:17,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1613 states and 1953 transitions. [2018-11-10 10:15:17,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 1953 transitions. [2018-11-10 10:15:17,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-10 10:15:17,023 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:17,085 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 10:15:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1631 states and 1985 transitions. [2018-11-10 10:15:19,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 1985 transitions. [2018-11-10 10:15:19,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-10 10:15:19,887 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:19,938 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 10:15:20,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:20,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1645 states and 1998 transitions. [2018-11-10 10:15:20,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 1998 transitions. [2018-11-10 10:15:20,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-10 10:15:20,768 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:20,824 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 10:15:21,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:21,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 1655 states and 2010 transitions. [2018-11-10 10:15:21,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2010 transitions. [2018-11-10 10:15:21,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-10 10:15:21,924 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:21,986 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 10:15:22,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:22,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 1659 states and 2014 transitions. [2018-11-10 10:15:22,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2014 transitions. [2018-11-10 10:15:22,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-10 10:15:22,423 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:22,483 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 10:15:22,766 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2018-11-10 10:15:23,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:23,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 1668 states and 2024 transitions. [2018-11-10 10:15:23,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2024 transitions. [2018-11-10 10:15:23,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-10 10:15:23,533 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:23,595 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 10:15:24,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:24,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 1673 states and 2028 transitions. [2018-11-10 10:15:24,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2028 transitions. [2018-11-10 10:15:24,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-10 10:15:24,864 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:25,635 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 283 proven. 21 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 10:15:27,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:27,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 1684 states and 2043 transitions. [2018-11-10 10:15:27,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2043 transitions. [2018-11-10 10:15:27,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-10 10:15:27,454 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:27,531 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 283 proven. 21 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 10:15:28,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:28,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 1695 states and 2056 transitions. [2018-11-10 10:15:28,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2056 transitions. [2018-11-10 10:15:28,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-10 10:15:28,660 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 283 proven. 21 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 10:15:29,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:29,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 1709 states and 2069 transitions. [2018-11-10 10:15:29,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2069 transitions. [2018-11-10 10:15:29,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-10 10:15:29,707 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:29,997 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 258 proven. 34 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 10:15:31,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:31,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 1714 states and 2075 transitions. [2018-11-10 10:15:31,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2075 transitions. [2018-11-10 10:15:31,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-10 10:15:31,036 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:31,103 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-10 10:15:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:31,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 1723 states and 2083 transitions. [2018-11-10 10:15:31,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2083 transitions. [2018-11-10 10:15:31,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-10 10:15:31,242 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-10 10:15:32,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:32,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 1739 states and 2098 transitions. [2018-11-10 10:15:32,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2098 transitions. [2018-11-10 10:15:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-10 10:15:32,678 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-10 10:15:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:33,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 1753 states and 2112 transitions. [2018-11-10 10:15:33,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2112 transitions. [2018-11-10 10:15:33,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-10 10:15:33,557 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:33,617 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-10 10:15:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 1755 states and 2113 transitions. [2018-11-10 10:15:34,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2113 transitions. [2018-11-10 10:15:34,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-10 10:15:34,110 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-10 10:15:34,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:34,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 1757 states and 2114 transitions. [2018-11-10 10:15:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 2114 transitions. [2018-11-10 10:15:34,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-11-10 10:15:34,673 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:35,174 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 10:15:38,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:38,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 1796 states and 2155 transitions. [2018-11-10 10:15:38,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2155 transitions. [2018-11-10 10:15:38,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-11-10 10:15:38,194 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 403 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 10:15:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:42,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 1815 states and 2178 transitions. [2018-11-10 10:15:42,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2178 transitions. [2018-11-10 10:15:42,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-10 10:15:42,679 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:15:42,752 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-10 10:15:43,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:15:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 1829 states and 2196 transitions. [2018-11-10 10:15:43,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2196 transitions. [2018-11-10 10:15:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-10 10:15:43,157 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:15:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:15:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:15:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:15:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:15:43,479 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 111 iterations. [2018-11-10 10:15:43,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 10:15:43 ImpRootNode [2018-11-10 10:15:43,634 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 10:15:43,634 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:15:43,635 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:15:43,635 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:15:43,635 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:13:55" (3/4) ... [2018-11-10 10:15:43,639 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 10:15:43,778 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a0461008-ae24-436b-b732-d1bfbba3ede4/bin-2019/ukojak/witness.graphml [2018-11-10 10:15:43,778 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:15:43,779 INFO L168 Benchmark]: Toolchain (without parser) took 110545.54 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 952.2 MB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 242.0 MB. Max. memory is 11.5 GB. [2018-11-10 10:15:43,779 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:15:43,780 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.39 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 922.6 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:15:43,780 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 922.6 MB in the beginning and 1.2 GB in the end (delta: -241.0 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:15:43,780 INFO L168 Benchmark]: Boogie Preprocessor took 49.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:15:43,780 INFO L168 Benchmark]: RCFGBuilder took 1615.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 922.7 MB in the end (delta: 236.1 MB). Peak memory consumption was 236.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:15:43,781 INFO L168 Benchmark]: CodeCheck took 108215.34 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 922.7 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:15:43,781 INFO L168 Benchmark]: Witness Printer took 143.59 ms. Allocated memory is still 3.0 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:15:43,782 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 199 locations, 1 error locations. UNSAFE Result, 108.0s OverallTime, 111 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 964891144 SDtfs, 1678253196 SDslu, -465849272 SDs, 0 SdLazy, -100206572 SolverSat, -1339799896 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 318.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110191 GetRequests, 105332 SyntacticMatches, 3673 SemanticMatches, 1186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 970034 ImplicationChecksByTransitivity, 92.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 13.1s InterpolantComputationTime, 17068 NumberOfCodeBlocks, 17068 NumberOfCodeBlocksAsserted, 111 NumberOfCheckSat, 16716 ConstructedInterpolants, 0 QuantifiedInterpolants, 13977465 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 110 InterpolantComputations, 88 PerfectInterpolantSequences, 14288/14647 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: 404]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] RET return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] RET return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] RET return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] RET return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND TRUE ((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1))) [L224] a21 = 1 [L225] a8 = 14 [L226] a16 = 4 [L227] a20 = 0 [L228] a7 = 0 [L229] a17 = 0 [L230] RET return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L403] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 388.39 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 922.6 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 129.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 922.6 MB in the beginning and 1.2 GB in the end (delta: -241.0 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1615.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 922.7 MB in the end (delta: 236.1 MB). Peak memory consumption was 236.1 MB. Max. memory is 11.5 GB. * CodeCheck took 108215.34 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 922.7 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 143.59 ms. Allocated memory is still 3.0 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...