./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ee31d27d-4e1b-42f1-93df-2f7038530ccd/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ee31d27d-4e1b-42f1-93df-2f7038530ccd/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ee31d27d-4e1b-42f1-93df-2f7038530ccd/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ee31d27d-4e1b-42f1-93df-2f7038530ccd/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label50.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ee31d27d-4e1b-42f1-93df-2f7038530ccd/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ee31d27d-4e1b-42f1-93df-2f7038530ccd/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.25-f470102 [2019-12-02 03:49:56,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-02 03:49:56,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-02 03:49:56,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-02 03:49:56,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-02 03:49:56,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-02 03:49:56,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-02 03:49:56,734 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-02 03:49:56,735 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-02 03:49:56,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-02 03:49:56,736 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-02 03:49:56,737 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-02 03:49:56,737 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-02 03:49:56,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-02 03:49:56,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-02 03:49:56,739 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-02 03:49:56,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-02 03:49:56,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-02 03:49:56,742 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-02 03:49:56,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-02 03:49:56,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-02 03:49:56,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-02 03:49:56,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-02 03:49:56,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-02 03:49:56,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-02 03:49:56,748 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-02 03:49:56,748 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-02 03:49:56,749 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-02 03:49:56,749 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-02 03:49:56,750 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-02 03:49:56,750 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-02 03:49:56,750 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-02 03:49:56,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-02 03:49:56,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-02 03:49:56,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-02 03:49:56,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-02 03:49:56,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-02 03:49:56,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-02 03:49:56,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-02 03:49:56,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-02 03:49:56,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-02 03:49:56,754 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ee31d27d-4e1b-42f1-93df-2f7038530ccd/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-12-02 03:49:56,763 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-02 03:49:56,763 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-02 03:49:56,764 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-02 03:49:56,764 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-02 03:49:56,764 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-02 03:49:56,764 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-02 03:49:56,765 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-02 03:49:56,765 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-02 03:49:56,765 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-02 03:49:56,765 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-02 03:49:56,765 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-02 03:49:56,765 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-02 03:49:56,765 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-02 03:49:56,765 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-02 03:49:56,766 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-02 03:49:56,766 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-02 03:49:56,766 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-02 03:49:56,766 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-02 03:49:56,766 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-02 03:49:56,766 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-02 03:49:56,766 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-02 03:49:56,767 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-02 03:49:56,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-02 03:49:56,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-02 03:49:56,767 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-02 03:49:56,767 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-02 03:49:56,767 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-12-02 03:49:56,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-02 03:49:56,767 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-02 03:49:56,768 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_ee31d27d-4e1b-42f1-93df-2f7038530ccd/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-12-02 03:49:56,867 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-02 03:49:56,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-02 03:49:56,878 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-02 03:49:56,880 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-02 03:49:56,880 INFO L275 PluginConnector]: CDTParser initialized [2019-12-02 03:49:56,881 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ee31d27d-4e1b-42f1-93df-2f7038530ccd/bin/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem02_label50.c [2019-12-02 03:49:56,927 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ee31d27d-4e1b-42f1-93df-2f7038530ccd/bin/ukojak/data/f54749eb8/79c9bbe7d2eb4bd29b718be77753ce64/FLAG906a6f401 [2019-12-02 03:49:57,386 INFO L306 CDTParser]: Found 1 translation units. [2019-12-02 03:49:57,386 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ee31d27d-4e1b-42f1-93df-2f7038530ccd/sv-benchmarks/c/eca-rers2012/Problem02_label50.c [2019-12-02 03:49:57,394 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ee31d27d-4e1b-42f1-93df-2f7038530ccd/bin/ukojak/data/f54749eb8/79c9bbe7d2eb4bd29b718be77753ce64/FLAG906a6f401 [2019-12-02 03:49:57,403 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ee31d27d-4e1b-42f1-93df-2f7038530ccd/bin/ukojak/data/f54749eb8/79c9bbe7d2eb4bd29b718be77753ce64 [2019-12-02 03:49:57,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-02 03:49:57,406 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-02 03:49:57,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-02 03:49:57,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-02 03:49:57,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-02 03:49:57,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:49:57" (1/1) ... [2019-12-02 03:49:57,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6947e074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:57, skipping insertion in model container [2019-12-02 03:49:57,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:49:57" (1/1) ... [2019-12-02 03:49:57,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-02 03:49:57,445 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-02 03:49:57,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 03:49:57,672 INFO L203 MainTranslator]: Completed pre-run [2019-12-02 03:49:57,734 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 03:49:57,744 INFO L208 MainTranslator]: Completed translation [2019-12-02 03:49:57,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:57 WrapperNode [2019-12-02 03:49:57,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-02 03:49:57,745 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-02 03:49:57,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-02 03:49:57,745 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-02 03:49:57,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:57" (1/1) ... [2019-12-02 03:49:57,763 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:57" (1/1) ... [2019-12-02 03:49:57,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-02 03:49:57,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-02 03:49:57,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-02 03:49:57,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-02 03:49:57,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:57" (1/1) ... [2019-12-02 03:49:57,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:57" (1/1) ... [2019-12-02 03:49:57,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:57" (1/1) ... [2019-12-02 03:49:57,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:57" (1/1) ... [2019-12-02 03:49:57,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:57" (1/1) ... [2019-12-02 03:49:57,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:57" (1/1) ... [2019-12-02 03:49:57,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:57" (1/1) ... [2019-12-02 03:49:57,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-02 03:49:57,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-02 03:49:57,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-02 03:49:57,837 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-02 03:49:57,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee31d27d-4e1b-42f1-93df-2f7038530ccd/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-12-02 03:49:57,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-02 03:49:57,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-02 03:49:59,018 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-02 03:49:59,019 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-02 03:49:59,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:49:59 BoogieIcfgContainer [2019-12-02 03:49:59,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-02 03:49:59,020 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-02 03:49:59,020 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-02 03:49:59,027 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-02 03:49:59,027 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:49:59" (1/1) ... [2019-12-02 03:49:59,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-02 03:49:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:49:59,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2019-12-02 03:49:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2019-12-02 03:49:59,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-02 03:49:59,063 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:49:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:49:59,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:49:59,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:49:59,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 163 states and 242 transitions. [2019-12-02 03:49:59,632 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2019-12-02 03:49:59,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-02 03:49:59,636 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:49:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:49:59,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:50:00,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:00,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 242 states and 336 transitions. [2019-12-02 03:50:00,110 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 336 transitions. [2019-12-02 03:50:00,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-02 03:50:00,112 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:50:00,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:00,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 246 states and 341 transitions. [2019-12-02 03:50:00,288 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 341 transitions. [2019-12-02 03:50:00,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-02 03:50:00,299 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:00,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:50:00,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:00,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 255 states and 355 transitions. [2019-12-02 03:50:00,447 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 355 transitions. [2019-12-02 03:50:00,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-02 03:50:00,451 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:00,475 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:50:00,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:00,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 258 states and 358 transitions. [2019-12-02 03:50:00,494 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 358 transitions. [2019-12-02 03:50:00,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-02 03:50:00,495 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:00,515 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:50:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:00,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 262 states and 364 transitions. [2019-12-02 03:50:00,634 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 364 transitions. [2019-12-02 03:50:00,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-02 03:50:00,635 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:00,660 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 03:50:00,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:00,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 266 states and 369 transitions. [2019-12-02 03:50:00,825 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 369 transitions. [2019-12-02 03:50:00,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-02 03:50:00,825 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:00,872 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:50:01,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 283 states and 394 transitions. [2019-12-02 03:50:01,027 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 394 transitions. [2019-12-02 03:50:01,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-02 03:50:01,028 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:01,046 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 03:50:01,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 284 states and 396 transitions. [2019-12-02 03:50:01,116 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 396 transitions. [2019-12-02 03:50:01,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-02 03:50:01,117 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:01,143 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 03:50:01,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:01,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 287 states and 399 transitions. [2019-12-02 03:50:01,237 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 399 transitions. [2019-12-02 03:50:01,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-02 03:50:01,238 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:01,276 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:50:01,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:01,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 290 states and 403 transitions. [2019-12-02 03:50:01,347 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 403 transitions. [2019-12-02 03:50:01,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-02 03:50:01,348 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:50:01,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 313 states and 434 transitions. [2019-12-02 03:50:01,950 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 434 transitions. [2019-12-02 03:50:01,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-02 03:50:01,951 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:01,967 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 03:50:02,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:02,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 315 states and 436 transitions. [2019-12-02 03:50:02,016 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 436 transitions. [2019-12-02 03:50:02,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-02 03:50:02,017 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:02,112 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 03:50:02,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:02,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 394 states and 518 transitions. [2019-12-02 03:50:02,565 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 518 transitions. [2019-12-02 03:50:02,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-02 03:50:02,566 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:02,666 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:50:03,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:03,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 416 states and 548 transitions. [2019-12-02 03:50:03,434 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 548 transitions. [2019-12-02 03:50:03,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-02 03:50:03,435 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:03,523 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:50:03,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:03,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 419 states and 551 transitions. [2019-12-02 03:50:03,647 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 551 transitions. [2019-12-02 03:50:03,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-02 03:50:03,648 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:03,731 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:50:03,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:03,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 422 states and 554 transitions. [2019-12-02 03:50:03,857 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 554 transitions. [2019-12-02 03:50:03,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-02 03:50:03,858 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:04,137 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 39 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:50:05,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:05,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 454 states and 599 transitions. [2019-12-02 03:50:05,449 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 599 transitions. [2019-12-02 03:50:05,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-02 03:50:05,450 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:05,484 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 39 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:50:05,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:05,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 457 states and 602 transitions. [2019-12-02 03:50:05,666 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 602 transitions. [2019-12-02 03:50:05,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-02 03:50:05,666 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:05,683 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-02 03:50:05,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:05,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 459 states and 604 transitions. [2019-12-02 03:50:05,798 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 604 transitions. [2019-12-02 03:50:05,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-02 03:50:05,799 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:05,827 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 03:50:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:06,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 473 states and 624 transitions. [2019-12-02 03:50:06,059 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 624 transitions. [2019-12-02 03:50:06,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-02 03:50:06,060 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:06,082 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 03:50:06,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:06,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 477 states and 628 transitions. [2019-12-02 03:50:06,173 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 628 transitions. [2019-12-02 03:50:06,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-02 03:50:06,174 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:06,191 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-02 03:50:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 484 states and 635 transitions. [2019-12-02 03:50:06,221 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 635 transitions. [2019-12-02 03:50:06,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-02 03:50:06,222 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-02 03:50:06,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:06,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 491 states and 643 transitions. [2019-12-02 03:50:06,543 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 643 transitions. [2019-12-02 03:50:06,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-12-02 03:50:06,543 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:06,783 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 03:50:07,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:07,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 515 states and 674 transitions. [2019-12-02 03:50:07,875 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 674 transitions. [2019-12-02 03:50:07,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-12-02 03:50:07,876 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:07,921 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 03:50:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:08,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 521 states and 680 transitions. [2019-12-02 03:50:08,251 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 680 transitions. [2019-12-02 03:50:08,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-12-02 03:50:08,252 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:08,296 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 03:50:08,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:08,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 525 states and 683 transitions. [2019-12-02 03:50:08,500 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 683 transitions. [2019-12-02 03:50:08,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-12-02 03:50:08,501 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:08,519 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-02 03:50:08,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:08,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 529 states and 691 transitions. [2019-12-02 03:50:08,671 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 691 transitions. [2019-12-02 03:50:08,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-02 03:50:08,672 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:08,771 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 03:50:09,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 550 states and 713 transitions. [2019-12-02 03:50:09,116 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 713 transitions. [2019-12-02 03:50:09,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-02 03:50:09,116 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-02 03:50:09,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 551 states and 714 transitions. [2019-12-02 03:50:09,154 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 714 transitions. [2019-12-02 03:50:09,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-02 03:50:09,155 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:09,173 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 03:50:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:09,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 552 states and 715 transitions. [2019-12-02 03:50:09,189 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 715 transitions. [2019-12-02 03:50:09,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-02 03:50:09,190 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:09,312 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:50:10,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:10,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 570 states and 740 transitions. [2019-12-02 03:50:10,400 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 740 transitions. [2019-12-02 03:50:10,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-02 03:50:10,401 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:10,470 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:50:10,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:10,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 573 states and 743 transitions. [2019-12-02 03:50:10,669 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 743 transitions. [2019-12-02 03:50:10,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-02 03:50:10,670 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:10,691 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 03:50:10,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:10,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 589 states and 761 transitions. [2019-12-02 03:50:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 761 transitions. [2019-12-02 03:50:10,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-12-02 03:50:10,753 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:10,774 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-02 03:50:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:10,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 591 states and 762 transitions. [2019-12-02 03:50:10,791 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 762 transitions. [2019-12-02 03:50:10,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-12-02 03:50:10,792 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:10,814 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-12-02 03:50:11,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:11,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 598 states and 772 transitions. [2019-12-02 03:50:11,313 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 772 transitions. [2019-12-02 03:50:11,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-12-02 03:50:11,314 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:11,347 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-12-02 03:50:11,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:11,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 602 states and 777 transitions. [2019-12-02 03:50:11,534 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 777 transitions. [2019-12-02 03:50:11,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-12-02 03:50:11,535 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:11,555 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-02 03:50:11,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:11,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 611 states and 787 transitions. [2019-12-02 03:50:11,693 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 787 transitions. [2019-12-02 03:50:11,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-12-02 03:50:11,694 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:11,719 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 03:50:11,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:11,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 613 states and 789 transitions. [2019-12-02 03:50:11,740 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 789 transitions. [2019-12-02 03:50:11,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-12-02 03:50:11,741 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:11,833 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 03:50:12,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:12,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 617 states and 796 transitions. [2019-12-02 03:50:12,383 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 796 transitions. [2019-12-02 03:50:12,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-12-02 03:50:12,384 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:12,406 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 03:50:12,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 619 states and 798 transitions. [2019-12-02 03:50:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 798 transitions. [2019-12-02 03:50:12,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-12-02 03:50:12,429 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:12,571 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 58 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-02 03:50:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:13,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 669 states and 854 transitions. [2019-12-02 03:50:13,410 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 854 transitions. [2019-12-02 03:50:13,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-12-02 03:50:13,411 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 03:50:14,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:14,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 674 states and 861 transitions. [2019-12-02 03:50:14,002 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 861 transitions. [2019-12-02 03:50:14,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-12-02 03:50:14,003 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:14,027 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 03:50:14,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:14,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 675 states and 862 transitions. [2019-12-02 03:50:14,041 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 862 transitions. [2019-12-02 03:50:14,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-12-02 03:50:14,042 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:14,064 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-02 03:50:14,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:14,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 685 states and 875 transitions. [2019-12-02 03:50:14,490 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 875 transitions. [2019-12-02 03:50:14,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-12-02 03:50:14,490 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:14,512 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-02 03:50:14,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 687 states and 876 transitions. [2019-12-02 03:50:14,724 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 876 transitions. [2019-12-02 03:50:14,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-12-02 03:50:14,725 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:14,758 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 03:50:14,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:14,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 688 states and 877 transitions. [2019-12-02 03:50:14,778 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 877 transitions. [2019-12-02 03:50:14,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-02 03:50:14,779 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:14,878 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 03:50:15,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 702 states and 891 transitions. [2019-12-02 03:50:15,194 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 891 transitions. [2019-12-02 03:50:15,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-02 03:50:15,195 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:15,218 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-02 03:50:15,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:15,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 706 states and 894 transitions. [2019-12-02 03:50:15,242 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 894 transitions. [2019-12-02 03:50:15,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-12-02 03:50:15,243 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:15,328 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 03:50:16,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 724 states and 916 transitions. [2019-12-02 03:50:16,228 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 916 transitions. [2019-12-02 03:50:16,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-12-02 03:50:16,229 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:16,313 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 03:50:16,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:16,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 725 states and 916 transitions. [2019-12-02 03:50:16,332 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 916 transitions. [2019-12-02 03:50:16,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-12-02 03:50:16,333 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:16,417 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 03:50:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:16,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 726 states and 917 transitions. [2019-12-02 03:50:16,465 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 917 transitions. [2019-12-02 03:50:16,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-12-02 03:50:16,465 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:16,488 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 03:50:16,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:16,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 730 states and 922 transitions. [2019-12-02 03:50:16,717 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 922 transitions. [2019-12-02 03:50:16,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-12-02 03:50:16,718 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:16,749 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:50:17,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:17,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 758 states and 953 transitions. [2019-12-02 03:50:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 953 transitions. [2019-12-02 03:50:17,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-02 03:50:17,078 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 73 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 03:50:19,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:19,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 786 states and 987 transitions. [2019-12-02 03:50:19,574 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 987 transitions. [2019-12-02 03:50:19,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-02 03:50:19,575 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:19,651 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 73 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 03:50:19,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:19,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 789 states and 990 transitions. [2019-12-02 03:50:19,892 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 990 transitions. [2019-12-02 03:50:19,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-02 03:50:19,893 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:19,915 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 03:50:19,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:19,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 792 states and 993 transitions. [2019-12-02 03:50:19,936 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 993 transitions. [2019-12-02 03:50:19,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-02 03:50:19,937 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:20,034 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 03:50:21,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:21,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 816 states and 1017 transitions. [2019-12-02 03:50:21,307 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1017 transitions. [2019-12-02 03:50:21,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-02 03:50:21,308 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:50:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:21,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 836 states and 1038 transitions. [2019-12-02 03:50:21,795 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1038 transitions. [2019-12-02 03:50:21,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-02 03:50:21,795 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:21,869 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:50:22,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:22,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 852 states and 1061 transitions. [2019-12-02 03:50:22,764 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1061 transitions. [2019-12-02 03:50:22,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-02 03:50:22,765 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:22,860 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:50:23,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:23,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 855 states and 1064 transitions. [2019-12-02 03:50:23,079 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1064 transitions. [2019-12-02 03:50:23,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-02 03:50:23,080 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:23,151 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 03:50:23,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 858 states and 1067 transitions. [2019-12-02 03:50:23,425 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1067 transitions. [2019-12-02 03:50:23,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-02 03:50:23,427 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:23,596 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 03:50:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:24,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 876 states and 1089 transitions. [2019-12-02 03:50:24,436 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1089 transitions. [2019-12-02 03:50:24,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-02 03:50:24,437 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:24,601 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 03:50:24,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:24,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 878 states and 1091 transitions. [2019-12-02 03:50:24,785 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1091 transitions. [2019-12-02 03:50:24,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-02 03:50:24,786 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:24,946 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 03:50:25,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 882 states and 1094 transitions. [2019-12-02 03:50:25,186 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1094 transitions. [2019-12-02 03:50:25,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-02 03:50:25,187 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:25,227 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-12-02 03:50:25,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 978 states and 1193 transitions. [2019-12-02 03:50:25,989 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1193 transitions. [2019-12-02 03:50:25,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-02 03:50:25,990 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:26,020 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 03:50:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1000 states and 1216 transitions. [2019-12-02 03:50:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1216 transitions. [2019-12-02 03:50:26,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-02 03:50:26,290 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-02 03:50:26,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:26,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1001 states and 1216 transitions. [2019-12-02 03:50:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1216 transitions. [2019-12-02 03:50:26,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-12-02 03:50:26,373 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:26,464 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 03:50:27,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:27,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1013 states and 1231 transitions. [2019-12-02 03:50:27,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1231 transitions. [2019-12-02 03:50:27,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-02 03:50:27,160 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:27,671 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 128 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 03:50:32,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:32,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1028 states and 1257 transitions. [2019-12-02 03:50:32,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1257 transitions. [2019-12-02 03:50:32,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-02 03:50:32,882 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:33,018 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 128 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 03:50:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:33,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1034 states and 1264 transitions. [2019-12-02 03:50:33,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1264 transitions. [2019-12-02 03:50:33,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-02 03:50:33,523 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-02 03:50:33,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:33,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1039 states and 1269 transitions. [2019-12-02 03:50:33,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1269 transitions. [2019-12-02 03:50:33,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-02 03:50:33,930 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:33,962 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-02 03:50:34,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:34,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1048 states and 1281 transitions. [2019-12-02 03:50:34,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1281 transitions. [2019-12-02 03:50:34,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-02 03:50:34,669 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:34,706 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-02 03:50:35,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:35,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1062 states and 1295 transitions. [2019-12-02 03:50:35,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1295 transitions. [2019-12-02 03:50:35,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-02 03:50:35,334 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-02 03:50:35,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:35,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1066 states and 1298 transitions. [2019-12-02 03:50:35,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1298 transitions. [2019-12-02 03:50:35,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-02 03:50:35,762 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:35,799 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 03:50:35,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:35,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1070 states and 1303 transitions. [2019-12-02 03:50:35,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1303 transitions. [2019-12-02 03:50:35,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-02 03:50:35,949 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:35,981 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-02 03:50:36,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:36,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1083 states and 1315 transitions. [2019-12-02 03:50:36,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1315 transitions. [2019-12-02 03:50:36,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-02 03:50:36,186 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:36,299 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-12-02 03:50:37,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:37,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1101 states and 1333 transitions. [2019-12-02 03:50:37,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1333 transitions. [2019-12-02 03:50:37,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-02 03:50:37,304 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:37,398 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-12-02 03:50:37,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1107 states and 1339 transitions. [2019-12-02 03:50:37,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1339 transitions. [2019-12-02 03:50:37,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-12-02 03:50:37,941 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:38,098 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 03:50:39,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:39,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1132 states and 1364 transitions. [2019-12-02 03:50:39,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1364 transitions. [2019-12-02 03:50:39,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-12-02 03:50:39,677 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:39,809 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-02 03:50:41,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:41,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1170 states and 1407 transitions. [2019-12-02 03:50:41,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1407 transitions. [2019-12-02 03:50:41,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-12-02 03:50:41,706 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-02 03:50:41,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:41,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1184 states and 1421 transitions. [2019-12-02 03:50:41,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1421 transitions. [2019-12-02 03:50:41,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-12-02 03:50:41,814 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:41,850 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-02 03:50:41,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1190 states and 1426 transitions. [2019-12-02 03:50:41,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1426 transitions. [2019-12-02 03:50:41,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-12-02 03:50:41,892 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-12-02 03:50:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:43,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1200 states and 1442 transitions. [2019-12-02 03:50:43,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1442 transitions. [2019-12-02 03:50:43,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-12-02 03:50:43,219 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:43,252 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-12-02 03:50:43,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:43,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1203 states and 1446 transitions. [2019-12-02 03:50:43,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1446 transitions. [2019-12-02 03:50:43,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-12-02 03:50:43,518 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:43,553 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 03:50:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:43,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1234 states and 1477 transitions. [2019-12-02 03:50:43,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1477 transitions. [2019-12-02 03:50:43,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-12-02 03:50:43,778 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:43,828 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 03:50:44,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:44,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1240 states and 1482 transitions. [2019-12-02 03:50:44,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1482 transitions. [2019-12-02 03:50:44,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-12-02 03:50:44,122 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 108 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-02 03:50:44,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:44,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1267 states and 1509 transitions. [2019-12-02 03:50:44,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1509 transitions. [2019-12-02 03:50:44,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-12-02 03:50:44,374 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-12-02 03:50:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1270 states and 1511 transitions. [2019-12-02 03:50:44,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1511 transitions. [2019-12-02 03:50:44,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-12-02 03:50:44,572 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-12-02 03:50:45,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:45,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1275 states and 1520 transitions. [2019-12-02 03:50:45,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1520 transitions. [2019-12-02 03:50:45,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-12-02 03:50:45,592 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:45,782 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 120 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-02 03:50:48,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:48,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1338 states and 1597 transitions. [2019-12-02 03:50:48,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1597 transitions. [2019-12-02 03:50:48,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-12-02 03:50:48,957 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:49,002 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-12-02 03:50:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1341 states and 1599 transitions. [2019-12-02 03:50:49,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1599 transitions. [2019-12-02 03:50:49,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-12-02 03:50:49,140 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:49,193 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-02 03:50:49,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:49,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1356 states and 1614 transitions. [2019-12-02 03:50:49,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1614 transitions. [2019-12-02 03:50:49,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-12-02 03:50:49,255 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:49,296 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 102 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 03:50:49,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:49,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1375 states and 1634 transitions. [2019-12-02 03:50:49,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1634 transitions. [2019-12-02 03:50:49,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-12-02 03:50:49,665 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:49,707 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 102 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 03:50:50,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:50,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1383 states and 1644 transitions. [2019-12-02 03:50:50,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1644 transitions. [2019-12-02 03:50:50,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-12-02 03:50:50,187 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 102 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 03:50:50,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:50,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1386 states and 1647 transitions. [2019-12-02 03:50:50,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1647 transitions. [2019-12-02 03:50:50,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-12-02 03:50:50,511 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 102 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 03:50:50,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:50,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1389 states and 1650 transitions. [2019-12-02 03:50:50,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1650 transitions. [2019-12-02 03:50:50,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-12-02 03:50:50,845 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:51,059 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-12-02 03:50:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1398 states and 1664 transitions. [2019-12-02 03:50:52,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1664 transitions. [2019-12-02 03:50:52,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-12-02 03:50:52,511 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:52,604 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 03:50:53,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:53,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1413 states and 1679 transitions. [2019-12-02 03:50:53,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1679 transitions. [2019-12-02 03:50:53,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-12-02 03:50:53,095 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:53,188 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 03:50:53,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:53,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1422 states and 1692 transitions. [2019-12-02 03:50:53,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1692 transitions. [2019-12-02 03:50:53,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-12-02 03:50:53,609 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:53,703 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 03:50:54,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1425 states and 1695 transitions. [2019-12-02 03:50:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1695 transitions. [2019-12-02 03:50:54,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-12-02 03:50:54,280 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:54,384 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 03:50:54,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1428 states and 1698 transitions. [2019-12-02 03:50:54,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1698 transitions. [2019-12-02 03:50:54,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-12-02 03:50:54,701 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:54,746 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-12-02 03:50:55,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:55,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1443 states and 1719 transitions. [2019-12-02 03:50:55,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1719 transitions. [2019-12-02 03:50:55,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-12-02 03:50:55,872 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-12-02 03:50:56,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:56,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1451 states and 1727 transitions. [2019-12-02 03:50:56,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1727 transitions. [2019-12-02 03:50:56,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-12-02 03:50:56,369 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-12-02 03:50:56,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:56,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1468 states and 1743 transitions. [2019-12-02 03:50:56,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1743 transitions. [2019-12-02 03:50:56,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-12-02 03:50:56,623 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:56,793 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 03:50:57,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:57,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1480 states and 1758 transitions. [2019-12-02 03:50:57,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1758 transitions. [2019-12-02 03:50:57,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-12-02 03:50:57,771 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:57,809 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 03:50:58,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1482 states and 1761 transitions. [2019-12-02 03:50:58,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1761 transitions. [2019-12-02 03:50:58,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-12-02 03:50:58,160 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 03:50:58,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:58,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1505 states and 1783 transitions. [2019-12-02 03:50:58,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1783 transitions. [2019-12-02 03:50:58,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-12-02 03:50:58,717 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 03:50:58,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:58,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1507 states and 1784 transitions. [2019-12-02 03:50:58,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1784 transitions. [2019-12-02 03:50:58,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-12-02 03:50:58,957 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:58,997 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-02 03:50:59,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:50:59,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1545 states and 1824 transitions. [2019-12-02 03:50:59,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1824 transitions. [2019-12-02 03:50:59,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-12-02 03:50:59,268 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:50:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:50:59,469 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-02 03:51:03,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:51:03,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1650 states and 1932 transitions. [2019-12-02 03:51:03,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 1932 transitions. [2019-12-02 03:51:03,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-12-02 03:51:03,034 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:51:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:51:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-02 03:51:03,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:51:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1653 states and 1934 transitions. [2019-12-02 03:51:03,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 1934 transitions. [2019-12-02 03:51:03,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-12-02 03:51:03,247 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:51:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:51:03,333 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-02 03:51:03,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:51:03,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1663 states and 1944 transitions. [2019-12-02 03:51:03,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 1944 transitions. [2019-12-02 03:51:03,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-12-02 03:51:03,895 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:51:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 03:51:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 164 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-02 03:51:04,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 03:51:04,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1671 states and 1951 transitions. [2019-12-02 03:51:04,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 1951 transitions. [2019-12-02 03:51:04,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-12-02 03:51:04,417 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 03:51:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 03:51:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 03:51:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 03:51:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 03:51:04,605 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 115 iterations. [2019-12-02 03:51:04,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 03:51:04 ImpRootNode [2019-12-02 03:51:04,763 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-12-02 03:51:04,763 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-02 03:51:04,763 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-02 03:51:04,764 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-02 03:51:04,764 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:49:59" (3/4) ... [2019-12-02 03:51:04,766 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-02 03:51:04,871 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ee31d27d-4e1b-42f1-93df-2f7038530ccd/bin/ukojak/witness.graphml [2019-12-02 03:51:04,871 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-02 03:51:04,873 INFO L168 Benchmark]: Toolchain (without parser) took 67466.59 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 625.0 MB). Free memory was 944.6 MB in the beginning and 1.3 GB in the end (delta: -397.4 MB). Peak memory consumption was 227.6 MB. Max. memory is 11.5 GB. [2019-12-02 03:51:04,873 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-02 03:51:04,873 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -130.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-12-02 03:51:04,873 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-02 03:51:04,874 INFO L168 Benchmark]: Boogie Preprocessor took 38.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-02 03:51:04,874 INFO L168 Benchmark]: RCFGBuilder took 1183.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 839.3 MB in the end (delta: 225.2 MB). Peak memory consumption was 225.2 MB. Max. memory is 11.5 GB. [2019-12-02 03:51:04,874 INFO L168 Benchmark]: CodeCheck took 65743.12 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 525.3 MB). Free memory was 839.3 MB in the beginning and 1.4 GB in the end (delta: -524.2 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2019-12-02 03:51:04,874 INFO L168 Benchmark]: Witness Printer took 107.72 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-12-02 03:51:04,876 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: 65.5s, OverallIterations: 115, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: -2111704000 SDtfs, -1086730784 SDslu, 220538272 SDs, 0 SdLazy, -873651716 SolverSat, -1383522960 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 282.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108723 GetRequests, 107290 SyntacticMatches, 713 SemanticMatches, 720 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361944 ImplicationChecksByTransitivity, 52.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 17234 NumberOfCodeBlocks, 17234 NumberOfCodeBlocksAsserted, 115 NumberOfCheckSat, 16910 ConstructedInterpolants, 0 QuantifiedInterpolants, 5786116 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 114 InterpolantComputations, 91 PerfectInterpolantSequences, 11135/11369 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 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 338.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -130.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1183.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 839.3 MB in the end (delta: 225.2 MB). Peak memory consumption was 225.2 MB. Max. memory is 11.5 GB. * CodeCheck took 65743.12 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 525.3 MB). Free memory was 839.3 MB in the beginning and 1.4 GB in the end (delta: -524.2 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * Witness Printer took 107.72 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...