./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fcc44e87-0e21-4a2a-8f85-0b731350d852/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fcc44e87-0e21-4a2a-8f85-0b731350d852/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fcc44e87-0e21-4a2a-8f85-0b731350d852/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fcc44e87-0e21-4a2a-8f85-0b731350d852/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label50.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fcc44e87-0e21-4a2a-8f85-0b731350d852/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fcc44e87-0e21-4a2a-8f85-0b731350d852/bin/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 c88dc41bb0c5752717ba5895f8d33afd40276a61 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.24-678e011 [2019-11-20 10:26:23,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:26:23,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:26:23,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:26:23,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:26:23,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:26:23,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:26:23,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:26:23,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:26:23,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:26:23,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:26:23,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:26:23,654 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:26:23,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:26:23,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:26:23,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:26:23,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:26:23,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:26:23,663 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:26:23,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:26:23,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:26:23,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:26:23,676 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:26:23,676 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:26:23,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:26:23,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:26:23,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:26:23,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:26:23,684 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:26:23,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:26:23,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:26:23,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:26:23,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:26:23,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:26:23,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:26:23,689 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:26:23,689 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:26:23,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:26:23,690 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:26:23,691 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:26:23,692 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:26:23,693 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fcc44e87-0e21-4a2a-8f85-0b731350d852/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-11-20 10:26:23,720 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:26:23,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:26:23,732 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-20 10:26:23,733 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-20 10:26:23,733 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:26:23,734 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:26:23,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:26:23,734 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:26:23,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 10:26:23,734 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:26:23,735 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:26:23,735 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 10:26:23,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:26:23,735 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 10:26:23,736 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:26:23,736 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:26:23,736 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:26:23,736 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 10:26:23,736 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-20 10:26:23,737 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-20 10:26:23,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:26:23,737 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:26:23,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 10:26:23,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:26:23,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:26:23,738 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 10:26:23,738 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-11-20 10:26:23,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 10:26:23,745 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 10:26:23,745 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_fcc44e87-0e21-4a2a-8f85-0b731350d852/bin/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__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 -> c88dc41bb0c5752717ba5895f8d33afd40276a61 [2019-11-20 10:26:23,888 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:26:23,904 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:26:23,907 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:26:23,908 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:26:23,908 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:26:23,909 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fcc44e87-0e21-4a2a-8f85-0b731350d852/bin/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem02_label50.c [2019-11-20 10:26:23,958 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fcc44e87-0e21-4a2a-8f85-0b731350d852/bin/ukojak/data/ad7bc47b1/9414891d82674b0fa199d3063f70c9f3/FLAG3c445c156 [2019-11-20 10:26:24,438 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:26:24,438 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fcc44e87-0e21-4a2a-8f85-0b731350d852/sv-benchmarks/c/eca-rers2012/Problem02_label50.c [2019-11-20 10:26:24,451 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fcc44e87-0e21-4a2a-8f85-0b731350d852/bin/ukojak/data/ad7bc47b1/9414891d82674b0fa199d3063f70c9f3/FLAG3c445c156 [2019-11-20 10:26:24,465 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fcc44e87-0e21-4a2a-8f85-0b731350d852/bin/ukojak/data/ad7bc47b1/9414891d82674b0fa199d3063f70c9f3 [2019-11-20 10:26:24,467 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:26:24,468 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:26:24,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:26:24,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:26:24,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:26:24,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:26:24" (1/1) ... [2019-11-20 10:26:24,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d00f58d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:26:24, skipping insertion in model container [2019-11-20 10:26:24,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:26:24" (1/1) ... [2019-11-20 10:26:24,483 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:26:24,524 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:26:25,002 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:26:25,007 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:26:25,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:26:25,110 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:26:25,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:26:25 WrapperNode [2019-11-20 10:26:25,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:26:25,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:26:25,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:26:25,112 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:26:25,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:26:25" (1/1) ... [2019-11-20 10:26:25,136 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:26:25" (1/1) ... [2019-11-20 10:26:25,183 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:26:25,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:26:25,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:26:25,184 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:26:25,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:26:25" (1/1) ... [2019-11-20 10:26:25,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:26:25" (1/1) ... [2019-11-20 10:26:25,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:26:25" (1/1) ... [2019-11-20 10:26:25,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:26:25" (1/1) ... [2019-11-20 10:26:25,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:26:25" (1/1) ... [2019-11-20 10:26:25,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:26:25" (1/1) ... [2019-11-20 10:26:25,253 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:26:25" (1/1) ... [2019-11-20 10:26:25,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:26:25,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:26:25,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:26:25,264 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:26:25,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:26:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fcc44e87-0e21-4a2a-8f85-0b731350d852/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 10:26:25,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:26:25,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:26:27,571 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:26:27,572 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 10:26:27,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:26:27 BoogieIcfgContainer [2019-11-20 10:26:27,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:26:27,601 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-20 10:26:27,601 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-20 10:26:27,614 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-20 10:26:27,615 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:26:27" (1/1) ... [2019-11-20 10:26:27,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:26:27,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:27,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2019-11-20 10:26:27,680 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2019-11-20 10:26:27,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 10:26:27,687 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:28,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:26:28,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:28,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 163 states and 242 transitions. [2019-11-20 10:26:28,858 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2019-11-20 10:26:28,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 10:26:28,865 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:29,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:26:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:29,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 242 states and 336 transitions. [2019-11-20 10:26:29,837 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 336 transitions. [2019-11-20 10:26:29,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 10:26:29,845 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:29,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:26:30,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:30,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 246 states and 341 transitions. [2019-11-20 10:26:30,175 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 341 transitions. [2019-11-20 10:26:30,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 10:26:30,183 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:30,236 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:26:30,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 255 states and 355 transitions. [2019-11-20 10:26:30,492 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 355 transitions. [2019-11-20 10:26:30,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-20 10:26:30,497 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:30,545 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:26:30,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 258 states and 358 transitions. [2019-11-20 10:26:30,581 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 358 transitions. [2019-11-20 10:26:30,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-20 10:26:30,586 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:26:30,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:30,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 262 states and 364 transitions. [2019-11-20 10:26:30,807 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 364 transitions. [2019-11-20 10:26:30,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 10:26:30,808 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 10:26:31,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:31,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 266 states and 369 transitions. [2019-11-20 10:26:31,104 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 369 transitions. [2019-11-20 10:26:31,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 10:26:31,104 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:31,188 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:26:31,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:31,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 283 states and 394 transitions. [2019-11-20 10:26:31,453 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 394 transitions. [2019-11-20 10:26:31,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 10:26:31,455 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:31,506 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 10:26:31,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:31,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 284 states and 396 transitions. [2019-11-20 10:26:31,640 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 396 transitions. [2019-11-20 10:26:31,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 10:26:31,642 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:31,700 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 10:26:31,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 287 states and 399 transitions. [2019-11-20 10:26:31,852 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 399 transitions. [2019-11-20 10:26:31,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 10:26:31,853 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:31,882 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:26:32,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:32,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 290 states and 403 transitions. [2019-11-20 10:26:32,003 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 403 transitions. [2019-11-20 10:26:32,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 10:26:32,005 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:32,110 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:26:32,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:32,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 313 states and 434 transitions. [2019-11-20 10:26:32,920 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 434 transitions. [2019-11-20 10:26:32,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 10:26:32,921 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:32,947 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 10:26:33,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:33,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 315 states and 436 transitions. [2019-11-20 10:26:33,021 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 436 transitions. [2019-11-20 10:26:33,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 10:26:33,023 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:33,187 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 10:26:34,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 394 states and 518 transitions. [2019-11-20 10:26:34,033 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 518 transitions. [2019-11-20 10:26:34,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 10:26:34,035 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:34,169 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:26:35,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:35,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 416 states and 548 transitions. [2019-11-20 10:26:35,401 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 548 transitions. [2019-11-20 10:26:35,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 10:26:35,403 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:35,634 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:26:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:35,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 419 states and 551 transitions. [2019-11-20 10:26:35,833 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 551 transitions. [2019-11-20 10:26:35,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 10:26:35,835 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:35,977 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:26:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 422 states and 554 transitions. [2019-11-20 10:26:36,202 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 554 transitions. [2019-11-20 10:26:36,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 10:26:36,204 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:36,756 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 39 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:26:38,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:38,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 454 states and 599 transitions. [2019-11-20 10:26:38,730 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 599 transitions. [2019-11-20 10:26:38,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 10:26:38,732 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:38,785 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 39 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:26:39,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:39,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 457 states and 602 transitions. [2019-11-20 10:26:39,042 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 602 transitions. [2019-11-20 10:26:39,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-20 10:26:39,044 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:39,083 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 10:26:39,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:39,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 459 states and 604 transitions. [2019-11-20 10:26:39,301 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 604 transitions. [2019-11-20 10:26:39,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:26:39,302 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:39,356 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 10:26:39,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:39,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 473 states and 624 transitions. [2019-11-20 10:26:39,969 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 624 transitions. [2019-11-20 10:26:39,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 10:26:39,973 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:40,038 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 10:26:40,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:40,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 477 states and 628 transitions. [2019-11-20 10:26:40,284 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 628 transitions. [2019-11-20 10:26:40,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 10:26:40,287 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-20 10:26:40,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:40,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 484 states and 635 transitions. [2019-11-20 10:26:40,420 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 635 transitions. [2019-11-20 10:26:40,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-20 10:26:40,422 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 10:26:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 491 states and 643 transitions. [2019-11-20 10:26:40,886 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 643 transitions. [2019-11-20 10:26:40,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-20 10:26:40,888 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:41,438 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 10:26:44,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:44,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 515 states and 674 transitions. [2019-11-20 10:26:44,384 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 674 transitions. [2019-11-20 10:26:44,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-20 10:26:44,386 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:44,531 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 10:26:45,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:45,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 521 states and 680 transitions. [2019-11-20 10:26:45,414 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 680 transitions. [2019-11-20 10:26:45,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-20 10:26:45,416 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:45,504 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 10:26:46,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 525 states and 683 transitions. [2019-11-20 10:26:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 683 transitions. [2019-11-20 10:26:46,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-20 10:26:46,015 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:46,062 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-20 10:26:46,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:46,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 529 states and 691 transitions. [2019-11-20 10:26:46,469 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 691 transitions. [2019-11-20 10:26:46,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 10:26:46,473 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:46,691 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 10:26:47,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:47,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 550 states and 713 transitions. [2019-11-20 10:26:47,585 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 713 transitions. [2019-11-20 10:26:47,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 10:26:47,588 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:47,629 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-20 10:26:47,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 551 states and 714 transitions. [2019-11-20 10:26:47,657 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 714 transitions. [2019-11-20 10:26:47,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 10:26:47,660 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:47,702 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:26:47,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:47,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 552 states and 715 transitions. [2019-11-20 10:26:47,733 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 715 transitions. [2019-11-20 10:26:47,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-20 10:26:47,735 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:48,076 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:26:50,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:50,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 570 states and 740 transitions. [2019-11-20 10:26:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 740 transitions. [2019-11-20 10:26:50,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-20 10:26:50,672 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:26:51,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:51,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 573 states and 743 transitions. [2019-11-20 10:26:51,360 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 743 transitions. [2019-11-20 10:26:51,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-20 10:26:51,363 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:51,414 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 10:26:51,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:51,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 589 states and 761 transitions. [2019-11-20 10:26:51,627 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 761 transitions. [2019-11-20 10:26:51,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-20 10:26:51,634 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:51,683 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 10:26:51,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:51,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 591 states and 762 transitions. [2019-11-20 10:26:51,715 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 762 transitions. [2019-11-20 10:26:51,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-20 10:26:51,718 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:51,765 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-20 10:26:52,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 598 states and 772 transitions. [2019-11-20 10:26:52,753 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 772 transitions. [2019-11-20 10:26:52,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-20 10:26:52,755 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:52,802 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-20 10:26:53,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 602 states and 777 transitions. [2019-11-20 10:26:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 777 transitions. [2019-11-20 10:26:53,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-20 10:26:53,249 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:53,294 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-20 10:26:53,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:53,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 611 states and 787 transitions. [2019-11-20 10:26:53,566 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 787 transitions. [2019-11-20 10:26:53,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-20 10:26:53,568 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 10:26:53,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:53,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 613 states and 789 transitions. [2019-11-20 10:26:53,656 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 789 transitions. [2019-11-20 10:26:53,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-20 10:26:53,658 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:26:55,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 617 states and 796 transitions. [2019-11-20 10:26:55,448 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 796 transitions. [2019-11-20 10:26:55,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-20 10:26:55,449 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:55,498 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 10:26:55,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 619 states and 798 transitions. [2019-11-20 10:26:55,544 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 798 transitions. [2019-11-20 10:26:55,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-20 10:26:55,546 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 58 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-20 10:26:57,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:57,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 669 states and 854 transitions. [2019-11-20 10:26:57,314 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 854 transitions. [2019-11-20 10:26:57,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-20 10:26:57,315 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:57,369 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:26:58,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:58,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 674 states and 861 transitions. [2019-11-20 10:26:58,316 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 861 transitions. [2019-11-20 10:26:58,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-20 10:26:58,318 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:58,373 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:26:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:58,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 675 states and 862 transitions. [2019-11-20 10:26:58,395 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 862 transitions. [2019-11-20 10:26:58,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-20 10:26:58,397 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:58,442 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 10:26:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:59,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 681 states and 870 transitions. [2019-11-20 10:26:59,179 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 870 transitions. [2019-11-20 10:26:59,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-20 10:26:59,181 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:59,225 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 10:26:59,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:59,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 687 states and 876 transitions. [2019-11-20 10:26:59,666 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 876 transitions. [2019-11-20 10:26:59,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-20 10:26:59,668 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:26:59,724 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:26:59,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:26:59,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 688 states and 877 transitions. [2019-11-20 10:26:59,755 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 877 transitions. [2019-11-20 10:26:59,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 10:26:59,757 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:26:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:00,031 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:27:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:00,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 702 states and 891 transitions. [2019-11-20 10:27:00,627 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 891 transitions. [2019-11-20 10:27:00,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 10:27:00,628 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:00,672 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 10:27:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:00,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 706 states and 894 transitions. [2019-11-20 10:27:00,730 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 894 transitions. [2019-11-20 10:27:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-20 10:27:00,732 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:00,924 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:27:02,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:02,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 724 states and 916 transitions. [2019-11-20 10:27:02,514 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 916 transitions. [2019-11-20 10:27:02,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-20 10:27:02,515 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:02,693 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:27:02,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 725 states and 916 transitions. [2019-11-20 10:27:02,719 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 916 transitions. [2019-11-20 10:27:02,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-20 10:27:02,720 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:02,947 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:27:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:03,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 726 states and 917 transitions. [2019-11-20 10:27:03,082 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 917 transitions. [2019-11-20 10:27:03,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-20 10:27:03,084 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:03,129 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:27:03,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 730 states and 922 transitions. [2019-11-20 10:27:03,681 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 922 transitions. [2019-11-20 10:27:03,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-20 10:27:03,682 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:03,756 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:27:04,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:04,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 758 states and 953 transitions. [2019-11-20 10:27:04,439 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 953 transitions. [2019-11-20 10:27:04,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 10:27:04,441 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 73 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 10:27:07,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:07,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 786 states and 987 transitions. [2019-11-20 10:27:07,098 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 987 transitions. [2019-11-20 10:27:07,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 10:27:07,100 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:07,284 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 73 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 10:27:07,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 789 states and 990 transitions. [2019-11-20 10:27:07,668 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 990 transitions. [2019-11-20 10:27:07,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-20 10:27:07,670 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:07,709 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:27:07,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:07,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 792 states and 993 transitions. [2019-11-20 10:27:07,739 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 993 transitions. [2019-11-20 10:27:07,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 10:27:07,740 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:07,943 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:27:09,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:09,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 812 states and 1013 transitions. [2019-11-20 10:27:09,422 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1013 transitions. [2019-11-20 10:27:09,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 10:27:09,423 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:09,587 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:27:10,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:10,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 816 states and 1017 transitions. [2019-11-20 10:27:10,055 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1017 transitions. [2019-11-20 10:27:10,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-20 10:27:10,056 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:10,199 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:27:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 836 states and 1038 transitions. [2019-11-20 10:27:10,883 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1038 transitions. [2019-11-20 10:27:10,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-20 10:27:10,884 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:11,051 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:27:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:12,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 852 states and 1061 transitions. [2019-11-20 10:27:12,655 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1061 transitions. [2019-11-20 10:27:12,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-20 10:27:12,658 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:27:13,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:13,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 855 states and 1064 transitions. [2019-11-20 10:27:13,317 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1064 transitions. [2019-11-20 10:27:13,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-20 10:27:13,319 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:27:13,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 858 states and 1067 transitions. [2019-11-20 10:27:13,811 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1067 transitions. [2019-11-20 10:27:13,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-20 10:27:13,812 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 10:27:15,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:15,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 876 states and 1089 transitions. [2019-11-20 10:27:15,191 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1089 transitions. [2019-11-20 10:27:15,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-20 10:27:15,192 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:15,493 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 10:27:15,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:15,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 878 states and 1091 transitions. [2019-11-20 10:27:15,787 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1091 transitions. [2019-11-20 10:27:15,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-20 10:27:15,789 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:16,176 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 10:27:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:16,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 882 states and 1094 transitions. [2019-11-20 10:27:16,706 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1094 transitions. [2019-11-20 10:27:16,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-20 10:27:16,708 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-11-20 10:27:18,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:18,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 978 states and 1193 transitions. [2019-11-20 10:27:18,082 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1193 transitions. [2019-11-20 10:27:18,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-20 10:27:18,147 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:18,205 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 10:27:18,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1000 states and 1216 transitions. [2019-11-20 10:27:18,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1216 transitions. [2019-11-20 10:27:18,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-20 10:27:18,718 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:27:18,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:18,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1001 states and 1216 transitions. [2019-11-20 10:27:18,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1216 transitions. [2019-11-20 10:27:18,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-20 10:27:18,880 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:19,030 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 10:27:20,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1013 states and 1231 transitions. [2019-11-20 10:27:20,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1231 transitions. [2019-11-20 10:27:20,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-20 10:27:20,187 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:20,920 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 128 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 10:27:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:24,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1028 states and 1257 transitions. [2019-11-20 10:27:24,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1257 transitions. [2019-11-20 10:27:24,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-20 10:27:24,553 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:24,676 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 128 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 10:27:25,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:25,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1034 states and 1264 transitions. [2019-11-20 10:27:25,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1264 transitions. [2019-11-20 10:27:25,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-20 10:27:25,525 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:25,578 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:27:26,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:26,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1039 states and 1269 transitions. [2019-11-20 10:27:26,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1269 transitions. [2019-11-20 10:27:26,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-20 10:27:26,211 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:26,273 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:27:27,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1048 states and 1281 transitions. [2019-11-20 10:27:27,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1281 transitions. [2019-11-20 10:27:27,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-20 10:27:27,186 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:27,231 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:27:28,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:28,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1062 states and 1295 transitions. [2019-11-20 10:27:28,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1295 transitions. [2019-11-20 10:27:28,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-20 10:27:28,097 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:28,224 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:27:28,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:28,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1066 states and 1298 transitions. [2019-11-20 10:27:28,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1298 transitions. [2019-11-20 10:27:28,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-20 10:27:28,830 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:28,883 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 10:27:29,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:29,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1070 states and 1303 transitions. [2019-11-20 10:27:29,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1303 transitions. [2019-11-20 10:27:29,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-20 10:27:29,184 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:29,244 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 10:27:29,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:29,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1083 states and 1315 transitions. [2019-11-20 10:27:29,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1315 transitions. [2019-11-20 10:27:29,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-20 10:27:29,560 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:29,792 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-20 10:27:32,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:32,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1107 states and 1339 transitions. [2019-11-20 10:27:32,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1339 transitions. [2019-11-20 10:27:32,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-20 10:27:32,627 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 10:27:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:34,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1132 states and 1364 transitions. [2019-11-20 10:27:34,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1364 transitions. [2019-11-20 10:27:34,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-20 10:27:34,943 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:35,237 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 10:27:36,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:36,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1170 states and 1407 transitions. [2019-11-20 10:27:36,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1407 transitions. [2019-11-20 10:27:36,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-20 10:27:36,901 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 10:27:37,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:37,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1184 states and 1421 transitions. [2019-11-20 10:27:37,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1421 transitions. [2019-11-20 10:27:37,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-20 10:27:37,054 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:37,093 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 10:27:37,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:37,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1190 states and 1426 transitions. [2019-11-20 10:27:37,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1426 transitions. [2019-11-20 10:27:37,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-20 10:27:37,138 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:37,399 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-20 10:27:38,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1200 states and 1442 transitions. [2019-11-20 10:27:38,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1442 transitions. [2019-11-20 10:27:38,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-20 10:27:38,885 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:38,930 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-20 10:27:39,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1203 states and 1446 transitions. [2019-11-20 10:27:39,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1446 transitions. [2019-11-20 10:27:39,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-20 10:27:39,282 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:39,393 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:27:39,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:39,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1234 states and 1477 transitions. [2019-11-20 10:27:39,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1477 transitions. [2019-11-20 10:27:39,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-20 10:27:39,679 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:39,726 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:27:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:40,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1240 states and 1482 transitions. [2019-11-20 10:27:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1482 transitions. [2019-11-20 10:27:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-20 10:27:40,094 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:40,288 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 108 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-20 10:27:40,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:40,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1267 states and 1509 transitions. [2019-11-20 10:27:40,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1509 transitions. [2019-11-20 10:27:40,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 10:27:40,396 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:40,446 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-20 10:27:40,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:40,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1270 states and 1511 transitions. [2019-11-20 10:27:40,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1511 transitions. [2019-11-20 10:27:40,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 10:27:40,701 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:40,974 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-20 10:27:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1275 states and 1520 transitions. [2019-11-20 10:27:41,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1520 transitions. [2019-11-20 10:27:41,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-20 10:27:41,876 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:42,109 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 120 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-20 10:27:45,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:45,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1338 states and 1597 transitions. [2019-11-20 10:27:45,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1597 transitions. [2019-11-20 10:27:45,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-20 10:27:45,602 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:45,649 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-20 10:27:45,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:45,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1341 states and 1599 transitions. [2019-11-20 10:27:45,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1599 transitions. [2019-11-20 10:27:45,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-20 10:27:45,852 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:45,933 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 10:27:46,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:46,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1356 states and 1614 transitions. [2019-11-20 10:27:46,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1614 transitions. [2019-11-20 10:27:46,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-20 10:27:46,032 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:46,080 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 102 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 10:27:47,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1386 states and 1647 transitions. [2019-11-20 10:27:47,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1647 transitions. [2019-11-20 10:27:47,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-20 10:27:47,410 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:47,472 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 102 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 10:27:47,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:47,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1389 states and 1650 transitions. [2019-11-20 10:27:47,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1650 transitions. [2019-11-20 10:27:47,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-20 10:27:47,822 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:48,124 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-11-20 10:27:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1398 states and 1664 transitions. [2019-11-20 10:27:49,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1664 transitions. [2019-11-20 10:27:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-20 10:27:49,139 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:49,245 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 10:27:50,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:50,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1422 states and 1692 transitions. [2019-11-20 10:27:50,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1692 transitions. [2019-11-20 10:27:50,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-20 10:27:50,337 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 10:27:50,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:50,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1425 states and 1695 transitions. [2019-11-20 10:27:50,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1695 transitions. [2019-11-20 10:27:50,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-20 10:27:50,827 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:50,937 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 10:27:51,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:51,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1428 states and 1698 transitions. [2019-11-20 10:27:51,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1698 transitions. [2019-11-20 10:27:51,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-20 10:27:51,328 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-20 10:27:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:52,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1443 states and 1719 transitions. [2019-11-20 10:27:52,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1719 transitions. [2019-11-20 10:27:52,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-20 10:27:52,768 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-20 10:27:53,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:53,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1451 states and 1727 transitions. [2019-11-20 10:27:53,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1727 transitions. [2019-11-20 10:27:53,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-20 10:27:53,510 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:53,562 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-20 10:27:53,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:53,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1468 states and 1743 transitions. [2019-11-20 10:27:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1743 transitions. [2019-11-20 10:27:53,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-20 10:27:53,922 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:54,150 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 10:27:55,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1482 states and 1761 transitions. [2019-11-20 10:27:55,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1761 transitions. [2019-11-20 10:27:55,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-20 10:27:55,762 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:55,808 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:27:56,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:56,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1505 states and 1783 transitions. [2019-11-20 10:27:56,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1783 transitions. [2019-11-20 10:27:56,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-20 10:27:56,443 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:56,500 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:27:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:56,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1507 states and 1784 transitions. [2019-11-20 10:27:56,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1784 transitions. [2019-11-20 10:27:56,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-20 10:27:56,724 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:56,778 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 10:27:57,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1545 states and 1824 transitions. [2019-11-20 10:27:57,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1824 transitions. [2019-11-20 10:27:57,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-20 10:27:57,260 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:27:57,493 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 10:27:59,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:27:59,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1650 states and 1932 transitions. [2019-11-20 10:27:59,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 1932 transitions. [2019-11-20 10:27:59,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-20 10:27:59,986 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:27:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:00,040 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:28:00,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:00,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1653 states and 1934 transitions. [2019-11-20 10:28:00,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 1934 transitions. [2019-11-20 10:28:00,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-20 10:28:00,316 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:00,426 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 10:28:01,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:01,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1663 states and 1944 transitions. [2019-11-20 10:28:01,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 1944 transitions. [2019-11-20 10:28:01,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-20 10:28:01,134 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:28:01,288 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 164 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-20 10:28:01,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 10:28:01,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1671 states and 1951 transitions. [2019-11-20 10:28:01,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 1951 transitions. [2019-11-20 10:28:01,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-20 10:28:01,796 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 10:28:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:28:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:28:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:28:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:28:02,060 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 111 iterations. [2019-11-20 10:28:02,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 20.11 10:28:02 ImpRootNode [2019-11-20 10:28:02,292 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-11-20 10:28:02,292 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 10:28:02,293 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 10:28:02,293 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 10:28:02,293 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:26:27" (3/4) ... [2019-11-20 10:28:02,295 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 10:28:02,466 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_fcc44e87-0e21-4a2a-8f85-0b731350d852/bin/ukojak/witness.graphml [2019-11-20 10:28:02,466 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 10:28:02,468 INFO L168 Benchmark]: Toolchain (without parser) took 97999.39 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -183.3 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-20 10:28:02,469 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:28:02,469 INFO L168 Benchmark]: CACSL2BoogieTranslator took 642.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:28:02,470 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:28:02,470 INFO L168 Benchmark]: Boogie Preprocessor took 79.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:28:02,470 INFO L168 Benchmark]: RCFGBuilder took 2337.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -21.8 MB). Peak memory consumption was 241.5 MB. Max. memory is 11.5 GB. [2019-11-20 10:28:02,471 INFO L168 Benchmark]: CodeCheck took 94691.23 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -33.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-20 10:28:02,471 INFO L168 Benchmark]: Witness Printer took 173.88 ms. Allocated memory is still 2.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2019-11-20 10:28:02,473 INFO L335 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, 85 locations, 1 error locations. Result: UNSAFE, OverallTime: 94.4s, OverallIterations: 111, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: -1742144960 SDtfs, 1278657504 SDslu, -1593928800 SDs, 0 SdLazy, -1391244804 SolverSat, 719507824 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 471.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104181 GetRequests, 102796 SyntacticMatches, 665 SemanticMatches, 720 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360160 ImplicationChecksByTransitivity, 75.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.5s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 16471 NumberOfCodeBlocks, 16471 NumberOfCodeBlocksAsserted, 111 NumberOfCheckSat, 16151 ConstructedInterpolants, 0 QuantifiedInterpolants, 5476761 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 110 InterpolantComputations, 90 PerfectInterpolantSequences, 10542/10730 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 415]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L235] a28 = 9 [L236] return 23; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L395] a19 = 0 [L396] a28 = 7 [L397] return 25; VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND TRUE ((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1)) [L55] a28 = 7 [L56] a11 = 1 [L57] a25 = 0 [L58] return -1; VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8)) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L415] __VERIFIER_error() VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 642.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 79.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2337.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -21.8 MB). Peak memory consumption was 241.5 MB. Max. memory is 11.5 GB. * CodeCheck took 94691.23 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -33.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 173.88 ms. Allocated memory is still 2.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...